Base | Representation |
---|---|
bin | 1010001100000001000011… |
… | …00010111001011000100011 |
3 | 2221022201100102001110212212 |
4 | 11012000201202321120203 |
5 | 10414023033211241003 |
6 | 115351503032512335 |
7 | 4501400001550235 |
oct | 506004142713043 |
9 | 87281312043785 |
10 | 22403112212003 |
11 | 7158119883156 |
12 | 2619a58b4b6ab |
13 | c667b1b98ab3 |
14 | 576460366255 |
15 | 28cb52ab8dd8 |
hex | 1460218b9623 |
22403112212003 has 16 divisors (see below), whose sum is σ = 22801350530880. Its totient is φ = 22005890524800.
The previous prime is 22403112211999. The next prime is 22403112212017. The reversal of 22403112212003 is 30021221130422.
It is a cyclic number.
It is not a de Polignac number, because 22403112212003 - 22 = 22403112211999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22403112212003.
It is not an unprimeable number, because it can be changed into a prime (22403112212053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157654058 + ... + 157796096.
It is an arithmetic number, because the mean of its divisors is an integer number (1425084408180).
Almost surely, 222403112212003 is an apocalyptic number.
22403112212003 is a deficient number, since it is larger than the sum of its proper divisors (398238318877).
22403112212003 is a wasteful number, since it uses less digits than its factorization.
22403112212003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145598.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 22403112212003 its reverse (30021221130422), we get a palindrome (52424333342425).
The spelling of 22403112212003 in words is "twenty-two trillion, four hundred three billion, one hundred twelve million, two hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •