Recognised as Number
2,215,463
- Positive
- Odd
- Prime
- 7 digits
2,215,463 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,215,463
Digit count7
Digit sum23
Digit product1,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,215,463
Distinct prime factors12,215,463
Number of divisors2
Sum of divisors σ(n)2,215,464
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,215,462integers below n that share no factor with it
Carmichael function λ(n)2,215,462the 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,215,4632 in total
Arithmetic
Previous number2,215,462
Next number2,215,464
Double4,430,926
Half1,107,731.5
Square4,908,276,304,369
Cube10,874,104,546,106,257,847
Square root1,488.443146378≈irrational, shown to 9 decimal places
Cube root130.363146366≈
Negation-2,215,463
Reciprocal4.51372918 × 10^-7≈
Representations
Decimal2,215,463
Binary100001110011100010011122 bits
Octal10347047
Hexadecimal21CE27
Base 361BHGN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and fifteen thousand, four hundred and sixty-three
Ordinaltwo million, two hundred and fifteen thousand, four hundred and sixty-third
Scientific notation2.215463 × 10^6
Engineering notation2.215463 × 10^6
In other bases
Ternary11011120001012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1031343323base 5; one hand: 10 digits
Septenary24555035base 7: 8 digits
Nonary4146035base 9; each digit is two ternary digits: 7 digits
Duodecimal8aa11bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldgid3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:15:24:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TTTT00011TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101101001001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011100111000100111
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
Bytes321 ce 27
Gray code1100010010100100110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011100111000100111
64-bit0000000000000000000000000000000000000000001000011100111000100111
One's complement11111111110111100011000111011000at 32 bits, every bit flipped
Bits reversed11100100011100111000010000000000at 32 bits
Rotated left by 100000000010000111001110001001110at 32 bits, wrapping
Shifted left by 110000111001110001001110= 4,430,926, no wrap
Shifted right by 1100001110011100010011= 1,107,731, discarding the low bit
These bits as a double1.09458416 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,215,463 to the power 24,908,276,304,369
2,215,463 to the power 310,874,104,546,106,257,847
2,215,463 to the power 424,091,176,280,030,208,328,488,161
2,215,463 to the power 553,373,109,674,884,565,434,057,366,633,543
First ten multiples2,215,463, 4,430,926, 6,646,389, 8,861,852, 11,077,315, 13,292,778, 15,508,241, 17,723,704, 19,939,167, 22,154,630
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1254the total stopping time
Highest value reached16,823,6807× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,215,463 → 6,646,390 → 3,323,195 → 9,969,586 → 4,984,793 → 14,954,380 → 7,477,190 → 3,738,595 → 11,215,786 → 5,607,893 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage221,546,300%
2,215,463% as a decimal22,154.63
2,215,463% of 1002,215,463
2,215,463% of 1,00022,154,630
As a fraction of 1002,215,463/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,215,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page