Recognised as Number
3,552,392
- Positive
- Even
- Composite
- 7 digits
3,552,392 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,552,392
Digit count7
Digit sum29
Digit product8,100
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 19 × 23,371
Distinct prime factors32, 19, 23,371
Number of divisors16
Sum of divisors σ(n)7,011,600
Aliquot sum3,459,208sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,682,640integers below n that share no factor with it
Carmichael function λ(n)70,110the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,682,640
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 19, 38, 76, 152, 23,371, 46,742, 93,484, 186,968, 444,049, 888,098, 1,776,196, 3,552,39216 in total
Arithmetic
Previous number3,552,391
Next number3,552,393
Double7,104,784
Half1,776,196
Square12,619,488,921,664
Cube44,829,371,489,407,820,288
Square root1,884.779032141≈irrational, shown to 9 decimal places
Cube root152.583285153≈
Negation-3,552,392
Reciprocal2.81500465 × 10^-7≈
Representations
Decimal3,552,392
Binary110110001101001000100022 bits
Octal15432210
Hexadecimal363488
Base 362451K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-two thousand, three hundred and ninety-two
Ordinalthree million, five hundred and fifty-two thousand, three hundred and ninety-second
Scientific notation3.552392 × 10^6
Engineering notation3.552392 × 10^6
In other bases
Ternary20200110222002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402134032base 5; one hand: 10 digits
Septenary42123554base 7: 8 digits
Nonary6613862base 9; each digit is two ternary digits: 7 digits
Duodecimal1233948base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1240jcbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:26:46:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T0011100T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100111010110011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100011010010001000
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes336 34 88
Gray code1011010010111011001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100011010010001000
64-bit0000000000000000000000000000000000000000001101100011010010001000
One's complement11111111110010011100101101110111at 32 bits, every bit flipped
Bits reversed00010001001011000110110000000000at 32 bits
Rotated left by 100000000011011000110100100010000at 32 bits, wrapping
Shifted left by 111011000110100100010000= 7,104,784, no wrap
Shifted right by 1110110001101001000100= 1,776,196, discarding the low bit
These bits as a double1.75511485 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,552,392 to the power 212,619,488,921,664
3,552,392 to the power 344,829,371,489,407,820,288
3,552,392 to the power 4159,251,500,644,000,425,528,528,896
3,552,392 to the power 5565,723,756,875,741,959,644,141,821,919,232
First ten multiples3,552,392, 7,104,784, 10,657,176, 14,209,568, 17,761,960, 21,314,352, 24,866,744, 28,419,136, 31,971,528, 35,523,920
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached3,552,392
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,552,392 → 1,776,196 → 888,098 → 444,049 → 1,332,148 → 666,074 → 333,037 → 999,112 → 499,556 → 249,778 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,239,200%
3,552,392% as a decimal35,523.92
3,552,392% of 1003,552,392
3,552,392% of 1,00035,523,920
As a fraction of 1003,552,392/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,552,392
Nerdulate something else
Nothing in mind? Surprise me · today’s page