Recognised as Number
3,344,901
- Positive
- Odd
- Composite
- 7 digits
3,344,901 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,344,901
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 149 × 1,069
Distinct prime factors43, 7, 149, 1,069
Number of divisors16
Sum of divisors σ(n)5,136,000
Aliquot sum1,791,099sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,896,768integers below n that share no factor with it
Carmichael function λ(n)39,516the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,896,768
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 149, 447, 1,043, 1,069, 3,129, 3,207, 7,483, 22,449, 159,281, 477,843, 1,114,967, 3,344,90116 in total
Arithmetic
Previous number3,344,900
Next number3,344,902
Double6,689,802
Half1,672,450.5
Square11,188,362,699,801
Cube37,423,965,582,927,064,701
Square root1,828.907050673≈irrational, shown to 9 decimal places
Cube root149.552756704≈
Negation-3,344,901
Reciprocal2.9896251 × 10^-7≈
Representations
Decimal3,344,901
Binary110011000010100000010122 bits
Octal14605005
Hexadecimal330A05
Base 361ZOXX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-four thousand, nine hundred and one
Ordinalthree million, three hundred and forty-four thousand, nine hundred and first
Scientific notation3.344901 × 10^6
Engineering notation3.344901 × 10^6
In other bases
Ternary20021221100020base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324014101base 5; one hand: 10 digits
Septenary40300620base 7: 8 digits
Nonary6257306base 9; each digit is two ternary digits: 7 digits
Duodecimal1153859base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10i251base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:29:8:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T0T11001T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110001111000000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110000101000000101
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 0a 05
Gray code1010101000111100000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110000101000000101
64-bit0000000000000000000000000000000000000000001100110000101000000101
One's complement11111111110011001111010111111010at 32 bits, every bit flipped
Bits reversed10100000010100001100110000000000at 32 bits
Rotated left by 100000000011001100001010000001010at 32 bits, wrapping
Shifted left by 111001100001010000001010= 6,689,802, no wrap
Shifted right by 1110011000010100000010= 1,672,450, discarding the low bit
These bits as a double1.65260067 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,344,901 to the power 211,188,362,699,801
3,344,901 to the power 337,423,965,582,927,064,701
3,344,901 to the power 4125,179,459,902,298,321,645,439,601
3,344,901 to the power 5418,712,900,606,657,558,370,152,566,824,501
First ten multiples3,344,901, 6,689,802, 10,034,703, 13,379,604, 16,724,505, 20,069,406, 23,414,307, 26,759,208, 30,104,109, 33,449,010
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1164the total stopping time
Highest value reached10,034,7043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,344,901 → 10,034,704 → 5,017,352 → 2,508,676 → 1,254,338 → 627,169 → 1,881,508 → 940,754 → 470,377 → 1,411,132 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,490,100%
3,344,901% as a decimal33,449.01
3,344,901% of 1003,344,901
3,344,901% of 1,00033,449,010
As a fraction of 1003,344,901/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,344,901
Nerdulate something else
Nothing in mind? Surprise me · today’s page