Recognised as Number
1,555,951
- Positive
- Odd
- Prime
- 7 digits
1,555,951 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,555,951
Digit count7
Digit sum31
Digit product5,625
Multiplicative persistence3times 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 factorisation1,555,951
Distinct prime factors11,555,951
Number of divisors2
Sum of divisors σ(n)1,555,952
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,555,950integers below n that share no factor with it
Carmichael function λ(n)1,555,950the 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, 1,555,9512 in total
Arithmetic
Previous number1,555,950
Next number1,555,952
Double3,111,902
Half777,975.5
Square2,420,983,514,401
Cube3,766,931,720,215,750,351
Square root1,247.377649311≈irrational, shown to 9 decimal places
Cube root115.877372394≈
Negation-1,555,951
Reciprocal6.42693761 × 10^-7≈
Representations
Decimal1,555,951
Binary10111101111011110111121 bits
Octal5736757
Hexadecimal17BDEF
Base 36XCKV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and fifty-five thousand, nine hundred and fifty-one
Ordinalone million, five hundred and fifty-five thousand, nine hundred and fifty-first
Scientific notation1.555951 × 10^6
Engineering notation1.555951 × 10^6
In other bases
Ternary2221001100211base 3; the most digit-efficient integer base after e: 13 digits
Quinary344242301base 5; one hand: 9 digits
Septenary16140205base 7: 8 digits
Nonary2831324base 9; each digit is two ternary digits: 7 digits
Duodecimal630527base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9e9hbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:12:12:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T1001101T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001100001000110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101111011110111101111
Bit length21 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits4within that length
Bit parityodd17 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 bd ef
Gray code111000110001100011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101111011110111101111
64-bit0000000000000000000000000000000000000000000101111011110111101111
One's complement11111111111010000100001000010000at 32 bits, every bit flipped
Bits reversed11110111101111011110100000000000at 32 bits
Rotated left by 100000000001011110111101111011110at 32 bits, wrapping
Shifted left by 11011110111101111011110= 3,111,902, no wrap
Shifted right by 110111101111011110111= 777,975, discarding the low bit
These bits as a double7.68741936 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,555,951 to the power 22,420,983,514,401
1,555,951 to the power 33,766,931,720,215,750,351
1,555,951 to the power 45,861,161,177,001,416,974,388,801
1,555,951 to the power 59,119,679,594,516,531,742,717,229,304,751
First ten multiples1,555,951, 3,111,902, 4,667,853, 6,223,804, 7,779,755, 9,335,706, 10,891,657, 12,447,608, 14,003,559, 15,559,510
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 51
Collatz (3n + 1) trajectory
Steps to reach 1256the total stopping time
Highest value reached26,584,90017× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,555,951 → 4,667,854 → 2,333,927 → 7,001,782 → 3,500,891 → 10,502,674 → 5,251,337 → 15,754,012 → 7,877,006 → 3,938,503 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage155,595,100%
1,555,951% as a decimal15,559.51
1,555,951% of 1001,555,951
1,555,951% of 1,00015,559,510
As a fraction of 1001,555,951/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,555,951
Nerdulate something else
Nothing in mind? Surprise me · today’s page