Base | Representation |
---|---|
bin | 10100101011111111… |
… | …111000001110001011 |
3 | 2010100001200102110100 |
4 | 110223333320032023 |
5 | 330443012031443 |
6 | 14112101420443 |
7 | 1414313255064 |
oct | 245377701613 |
9 | 63301612410 |
10 | 22213002123 |
11 | 946972a2a4 |
12 | 437b10a723 |
13 | 213000c450 |
14 | 110a18956b |
15 | 8a01a53d3 |
hex | 52bff838b |
22213002123 has 24 divisors (see below), whose sum is σ = 36055891872. Its totient is φ = 13075210368.
The previous prime is 22213002103. The next prime is 22213002143. The reversal of 22213002123 is 32120031222.
It is an interprime number because it is at equal distance from previous prime (22213002103) and next prime (22213002143).
It is a de Polignac number, because none of the positive numbers 2k-22213002123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22213002096 and 22213002105.
It is not an unprimeable number, because it can be changed into a prime (22213002103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4124586 + ... + 4129967.
It is an arithmetic number, because the mean of its divisors is an integer number (1502328828).
Almost surely, 222213002123 is an apocalyptic number.
22213002123 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
22213002123 is a deficient number, since it is larger than the sum of its proper divisors (13842889749).
22213002123 is a wasteful number, since it uses less digits than its factorization.
22213002123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8254595 (or 8254592 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 22213002123 its reverse (32120031222), we get a palindrome (54333033345).
The spelling of 22213002123 in words is "twenty-two billion, two hundred thirteen million, two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •