Recognised as Number
3,472,546
- Positive
- Even
- Composite
- 7 digits
3,472,546 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,472,546
Digit count7
Digit sum31
Digit product20,160
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 11 × 22,549
Distinct prime factors42, 7, 11, 22,549
Number of divisors16
Sum of divisors σ(n)6,494,400
Aliquot sum3,021,854sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,352,880integers below n that share no factor with it
Carmichael function λ(n)112,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,352,880
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 11, 14, 22, 77, 154, 22,549, 45,098, 157,843, 248,039, 315,686, 496,078, 1,736,273, 3,472,54616 in total
Arithmetic
Previous number3,472,545
Next number3,472,547
Double6,945,092
Half1,736,273
Square12,058,575,722,116
Cube41,873,958,889,531,027,336
Square root1,863.476857919≈irrational, shown to 9 decimal places
Cube root151.431422669≈
Negation-3,472,546
Reciprocal2.87973147 × 10^-7≈
Representations
Decimal3,472,546
Binary110100111111001010001022 bits
Octal15176242
Hexadecimal34FCA2
Base 3622FFM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seventy-two thousand, five hundred and forty-six
Ordinalthree million, four hundred and seventy-two thousand, five hundred and forty-sixth
Scientific notation3.472546 × 10^6
Engineering notation3.472546 × 10^6
In other bases
Ternary20112102102211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342110141base 5; one hand: 10 digits
Septenary41342020base 7: 8 digits
Nonary6472384base 9; each digit is two ternary digits: 7 digits
Duodecimal11b56aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11e176base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:4:35:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT11T110T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010000110111100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001111110010100010
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes334 fc a2
Gray code1011101000001011110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001111110010100010
64-bit0000000000000000000000000000000000000000001101001111110010100010
One's complement11111111110010110000001101011101at 32 bits, every bit flipped
Bits reversed01000101001111110010110000000000at 32 bits
Rotated left by 100000000011010011111100101000100at 32 bits, wrapping
Shifted left by 111010011111100101000100= 6,945,092, no wrap
Shifted right by 1110100111111001010001= 1,736,273, discarding the low bit
These bits as a double1.71566568 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,472,546 to the power 212,058,575,722,116
3,472,546 to the power 341,873,958,889,531,027,336
3,472,546 to the power 4145,409,248,446,005,410,851,517,456
3,472,546 to the power 5504,940,304,054,182,305,430,793,535,762,976
First ten multiples3,472,546, 6,945,092, 10,417,638, 13,890,184, 17,362,730, 20,835,276, 24,307,822, 27,780,368, 31,252,914, 34,725,460
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12No, remainder 10
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 1128the total stopping time
Highest value reached5,208,8201× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,472,546 → 1,736,273 → 5,208,820 → 2,604,410 → 1,302,205 → 3,906,616 → 1,953,308 → 976,654 → 488,327 → 1,464,982 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage347,254,600%
3,472,546% as a decimal34,725.46
3,472,546% of 1003,472,546
3,472,546% of 1,00034,725,460
As a fraction of 1003,472,546/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,472,546
Nerdulate something else
Nothing in mind? Surprise me · today’s page