Base | Representation |
---|---|
bin | 10100100000000101… |
… | …110011101111000111 |
3 | 2002211010202221122200 |
4 | 110200011303233013 |
5 | 330040341330043 |
6 | 14040203525543 |
7 | 1406336240121 |
oct | 244005635707 |
9 | 62733687580 |
10 | 22013230023 |
11 | 9376992594 |
12 | 43242298b3 |
13 | 20ca804ac5 |
14 | 10cb826211 |
15 | 88c8937d3 |
hex | 520173bc7 |
22013230023 has 6 divisors (see below), whose sum is σ = 31796887824. Its totient is φ = 14675486676.
The previous prime is 22013230021. The next prime is 22013230111. The reversal of 22013230023 is 32003231022.
It is a happy number.
It is not a de Polignac number, because 22013230023 - 21 = 22013230021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22013229978 and 22013230005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22013230021) 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 5 ways as a sum of consecutive naturals, for example, 1222957215 + ... + 1222957232.
It is an arithmetic number, because the mean of its divisors is an integer number (5299481304).
Almost surely, 222013230023 is an apocalyptic number.
22013230023 is a deficient number, since it is larger than the sum of its proper divisors (9783657801).
22013230023 is a wasteful number, since it uses less digits than its factorization.
22013230023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2445914453 (or 2445914450 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 22013230023 its reverse (32003231022), we get a palindrome (54016461045).
Subtracting 22013230023 from its reverse (32003231022), we obtain a palindrome (9990000999).
The spelling of 22013230023 in words is "twenty-two billion, thirteen million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •