Base | Representation |
---|---|
bin | 1010000100110001001001… |
… | …00001101011111101010111 |
3 | 2220102220111010022200020002 |
4 | 11002120210201223331113 |
5 | 10400433000323421401 |
6 | 115041233145401515 |
7 | 4444402053664553 |
oct | 502304441537527 |
9 | 86386433280202 |
10 | 22154054123351 |
11 | 7071532aa7937 |
12 | 259972ba9929b |
13 | c4916ccb90c7 |
14 | 568394aa0863 |
15 | 286427809a6b |
hex | 14262486bf57 |
22154054123351 has 4 divisors (see below), whose sum is σ = 22154164261272. Its totient is φ = 22153943985432.
The previous prime is 22154054123281. The next prime is 22154054123393. The reversal of 22154054123351 is 15332145045122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22154054123351 is a prime.
It is a super-2 number, since 2×221540541233512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22154054123051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54766685 + ... + 55169718.
It is an arithmetic number, because the mean of its divisors is an integer number (5538541065318).
Almost surely, 222154054123351 is an apocalyptic number.
22154054123351 is a deficient number, since it is larger than the sum of its proper divisors (110137921).
22154054123351 is a wasteful number, since it uses less digits than its factorization.
22154054123351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110137920.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 22154054123351 its reverse (15332145045122), we get a palindrome (37486199168473).
The spelling of 22154054123351 in words is "twenty-two trillion, one hundred fifty-four billion, fifty-four million, one hundred twenty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •