Recognised as Number
3,552,391
- Positive
- Odd
- Prime
- 7 digits
3,552,391 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,552,391
Digit count7
Digit sum28
Digit product4,050
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,552,391
Distinct prime factors13,552,391
Number of divisors2
Sum of divisors σ(n)3,552,392
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,552,390integers below n that share no factor with it
Carmichael function λ(n)3,552,390the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,552,3912 in total
Arithmetic
Previous number3,552,390
Next number3,552,392
Double7,104,782
Half1,776,195.5
Square12,619,481,816,881
Cube44,829,333,630,951,712,471
Square root1,884.778766858≈irrational, shown to 9 decimal places
Cube root152.583270835≈
Negation-3,552,391
Reciprocal2.81500544 × 10^-7≈
Representations
Decimal3,552,391
Binary110110001101001000011122 bits
Octal15432207
Hexadecimal363487
Base 362451J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-two thousand, three hundred and ninety-one
Ordinalthree million, five hundred and fifty-two thousand, three hundred and ninety-first
Scientific notation3.552391 × 10^6
Engineering notation3.552391 × 10^6
In other bases
Ternary20200110222001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402134031base 5; one hand: 10 digits
Septenary42123553base 7: 8 digits
Nonary6613861base 9; each digit is two ternary digits: 7 digits
Duodecimal1233947base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1240jbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:26:46:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T0011100T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100111010110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100011010010000111
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; 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
Bytes336 34 87
Gray code1011010010111011000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100011010010000111
64-bit0000000000000000000000000000000000000000001101100011010010000111
One's complement11111111110010011100101101111000at 32 bits, every bit flipped
Bits reversed11100001001011000110110000000000at 32 bits
Rotated left by 100000000011011000110100100001110at 32 bits, wrapping
Shifted left by 111011000110100100001110= 7,104,782, no wrap
Shifted right by 1110110001101001000011= 1,776,195, discarding the low bit
These bits as a double1.75511435 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,552,391 to the power 212,619,481,816,881
3,552,391 to the power 344,829,333,630,951,712,471
3,552,391 to the power 4159,251,321,326,590,184,816,568,161
3,552,391 to the power 5565,722,960,618,687,033,230,713,386,022,951
First ten multiples3,552,391, 7,104,782, 10,657,173, 14,209,564, 17,761,955, 21,314,346, 24,866,737, 28,419,128, 31,971,519, 35,523,910
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached36,458,72810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,552,391 → 10,657,174 → 5,328,587 → 15,985,762 → 7,992,881 → 23,978,644 → 11,989,322 → 5,994,661 → 17,983,984 → 8,991,992 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,239,100%
3,552,391% as a decimal35,523.91
3,552,391% of 1003,552,391
3,552,391% of 1,00035,523,910
As a fraction of 1003,552,391/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,391
Nerdulate something else
Nothing in mind? Surprise me · today’s page