Recognised as Number
1,552,665
- Positive
- Odd
- Composite
- 7 digits
1,552,665 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,552,665
Digit count7
Digit sum30
Digit product9,000
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 5 × 103,511
Distinct prime factors33, 5, 103,511
Number of divisors8
Sum of divisors σ(n)2,484,288
Aliquot sum931,623sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)828,080integers below n that share no factor with it
Carmichael function λ(n)207,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 828,080
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 103,511, 310,533, 517,555, 1,552,6658 in total
Arithmetic
Previous number1,552,664
Next number1,552,666
Double3,105,330
Half776,332.5
Square2,410,768,602,225
Cube3,743,116,031,773,679,625
Square root1,246.059789898≈irrational, shown to 9 decimal places
Cube root115.795741414≈
Negation-1,552,665
Reciprocal6.44053933 × 10^-7≈
Representations
Decimal1,552,665
Binary10111101100010001100121 bits
Octal5730431
Hexadecimal17B119
Base 36XA1L
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and fifty-two thousand, six hundred and sixty-five
Ordinalone million, five hundred and fifty-two thousand, six hundred and sixty-fifth
Scientific notation1.552665 × 10^6
Engineering notation1.552665 × 10^6
In other bases
Ternary2220212212010base 3; the most digit-efficient integer base after e: 13 digits
Quinary344141130base 5; one hand: 9 digits
Septenary16124502base 7: 8 digits
Nonary2825763base 9; each digit is two ternary digits: 7 digits
Duodecimal62a649base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9e1d5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:11:17:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T10T00TT010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001111000101101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101111011000100011001
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes317 b1 19
Gray code111000110100110010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101111011000100011001
64-bit0000000000000000000000000000000000000000000101111011000100011001
One's complement11111111111010000100111011100110at 32 bits, every bit flipped
Bits reversed10011000100011011110100000000000at 32 bits
Rotated left by 100000000001011110110001000110010at 32 bits, wrapping
Shifted left by 11011110110001000110010= 3,105,330, no wrap
Shifted right by 110111101100010001100= 776,332, discarding the low bit
These bits as a double7.67118436 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,552,665 to the power 22,410,768,602,225
1,552,665 to the power 33,743,116,031,773,679,625
1,552,665 to the power 45,811,805,253,473,880,274,950,625
1,552,665 to the power 59,023,786,603,885,022,317,106,212,165,625
First ten multiples1,552,665, 3,105,330, 4,657,995, 6,210,660, 7,763,325, 9,315,990, 10,868,655, 12,421,320, 13,973,985, 15,526,650
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1225the total stopping time
Highest value reached5,384,3923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,552,665 → 4,657,996 → 2,328,998 → 1,164,499 → 3,493,498 → 1,746,749 → 5,240,248 → 2,620,124 → 1,310,062 → 655,031 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage155,266,500%
1,552,665% as a decimal15,526.65
1,552,665% of 1001,552,665
1,552,665% of 1,00015,526,650
As a fraction of 1001,552,665/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 1,552,665
Nerdulate something else
Nothing in mind? Surprise me · today’s page