Recognised as Number
2,164,901
- Positive
- Odd
- Prime
- 7 digits
2,164,901 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,164,901
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,164,901
Distinct prime factors12,164,901
Number of divisors2
Sum of divisors σ(n)2,164,902
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,164,900integers below n that share no factor with it
Carmichael function λ(n)2,164,900the 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, 2,164,9012 in total
Arithmetic
Previous number2,164,900
Next number2,164,902
Double4,329,802
Half1,082,450.5
Square4,686,796,339,801
Cube10,146,450,082,831,524,701
Square root1,471.360255002≈irrational, shown to 9 decimal places
Cube root129.363774999≈
Negation-2,164,901
Reciprocal4.61914887 × 10^-7≈
Representations
Decimal2,164,901
Binary100001000010001010010122 bits
Octal10204245
Hexadecimal2108A5
Base 361AEG5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and sixty-four thousand, nine hundred and one
Ordinaltwo million, one hundred and sixty-four thousand, nine hundred and first
Scientific notation2.164901 × 10^6
Engineering notation2.164901 × 10^6
In other bases
Ternary11001222200112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1023234101base 5; one hand: 10 digits
Septenary24254444base 7: 8 digits
Nonary4058615base 9; each digit is two ternary digits: 7 digits
Duodecimal884a05base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldac51base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:1:21:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1101T000T01TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010001100111100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010000100010100101
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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
Bytes321 08 a5
Gray code1100011000110011110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010000100010100101
64-bit0000000000000000000000000000000000000000001000010000100010100101
One's complement11111111110111101111011101011010at 32 bits, every bit flipped
Bits reversed10100101000100001000010000000000at 32 bits
Rotated left by 100000000010000100001000101001010at 32 bits, wrapping
Shifted left by 110000100001000101001010= 4,329,802, no wrap
Shifted right by 1100001000010001010010= 1,082,450, discarding the low bit
These bits as a double1.06960321 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,164,901 to the power 24,686,796,339,801
2,164,901 to the power 310,146,450,082,831,524,701
2,164,901 to the power 421,966,059,930,772,050,656,719,601
2,164,901 to the power 547,554,345,110,188,343,238,782,920,924,501
First ten multiples2,164,901, 4,329,802, 6,494,703, 8,659,604, 10,824,505, 12,989,406, 15,154,307, 17,319,208, 19,484,109, 21,649,010
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1210the total stopping time
Highest value reached6,935,5243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,164,901 → 6,494,704 → 3,247,352 → 1,623,676 → 811,838 → 405,919 → 1,217,758 → 608,879 → 1,826,638 → 913,319 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage216,490,100%
2,164,901% as a decimal21,649.01
2,164,901% of 1002,164,901
2,164,901% of 1,00021,649,010
As a fraction of 1002,164,901/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 2,164,901
Nerdulate something else
Nothing in mind? Surprise me · today’s page