Base | Representation |
---|---|
bin | 10100011111111110… |
… | …011100110010011111 |
3 | 2002211000010221120020 |
4 | 110133332130302133 |
5 | 330034343113043 |
6 | 14040054323223 |
7 | 1406313654165 |
oct | 243776346237 |
9 | 62730127506 |
10 | 22011301023 |
11 | 9375895278 |
12 | 4323659513 |
13 | 20ca2aaa9a |
14 | 10cb483235 |
15 | 88c611e83 |
hex | 51ff9cc9f |
22011301023 has 8 divisors (see below), whose sum is σ = 29456699136. Its totient is φ = 14620051800.
The previous prime is 22011301019. The next prime is 22011301031. The reversal of 22011301023 is 32010311022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22011301023 - 22 = 22011301019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22011300993 and 22011301011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011301723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13536273 + ... + 13537898.
It is an arithmetic number, because the mean of its divisors is an integer number (3682087392).
Almost surely, 222011301023 is an apocalyptic number.
22011301023 is a deficient number, since it is larger than the sum of its proper divisors (7445398113).
22011301023 is a wasteful number, since it uses less digits than its factorization.
22011301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27074445.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 22011301023 its reverse (32010311022), we get a palindrome (54021612045).
Subtracting 22011301023 from its reverse (32010311022), we obtain a palindrome (9999009999).
The spelling of 22011301023 in words is "twenty-two billion, eleven million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •