Recognised as Number
2,228,423
- Positive
- Odd
- Prime
- 7 digits
2,228,423 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,228,423
Digit count7
Digit sum23
Digit product1,536
Multiplicative persistence3times 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,228,423
Distinct prime factors12,228,423
Number of divisors2
Sum of divisors σ(n)2,228,424
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,228,422integers below n that share no factor with it
Carmichael function λ(n)2,228,422the 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,228,4232 in total
Arithmetic
Previous number2,228,422
Next number2,228,424
Double4,456,846
Half1,114,211.5
Square4,965,869,066,929
Cube11,066,056,843,733,122,967
Square root1,492.790340269≈irrational, shown to 9 decimal places
Cube root130.616851441≈
Negation-2,228,423
Reciprocal4.48747836 × 10^-7≈
Representations
Decimal2,228,423
Binary100010000000001100011122 bits
Octal10400307
Hexadecimal2200C7
Base 361BRGN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and twenty-eight thousand, four hundred and twenty-three
Ordinaltwo million, two hundred and twenty-eight thousand, four hundred and twenty-third
Scientific notation2.228423 × 10^6
Engineering notation2.228423 × 10^6
In other bases
Ternary11012012211012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1032302143base 5; one hand: 10 digits
Septenary24640601base 7: 8 digits
Nonary4165735base 9; each digit is two ternary digits: 7 digits
Duodecimal8b571bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldib13base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:19:0:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TT1T0T111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100000000111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100000000011000111
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
Bytes322 00 c7
Gray code1100110000000010100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100000000011000111
64-bit0000000000000000000000000000000000000000001000100000000011000111
One's complement11111111110111011111111100111000at 32 bits, every bit flipped
Bits reversed11100011000000000100010000000000at 32 bits
Rotated left by 100000000010001000000000110001110at 32 bits, wrapping
Shifted left by 110001000000000110001110= 4,456,846, no wrap
Shifted right by 1100010000000001100011= 1,114,211, discarding the low bit
These bits as a double1.10098725 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,228,423 to the power 24,965,869,066,929
2,228,423 to the power 311,066,056,843,733,122,967
2,228,423 to the power 424,659,855,589,882,297,081,491,041
2,228,423 to the power 554,952,589,373,172,278,109,227,510,058,343
First ten multiples2,228,423, 4,456,846, 6,685,269, 8,913,692, 11,142,115, 13,370,538, 15,598,961, 17,827,384, 20,055,807, 22,284,230
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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1316the total stopping time
Highest value reached16,062,7847× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,228,423 → 6,685,270 → 3,342,635 → 10,027,906 → 5,013,953 → 15,041,860 → 7,520,930 → 3,760,465 → 11,281,396 → 5,640,698 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage222,842,300%
2,228,423% as a decimal22,284.23
2,228,423% of 1002,228,423
2,228,423% of 1,00022,284,230
As a fraction of 1002,228,423/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,228,423
Nerdulate something else
Nothing in mind? Surprise me · today’s page