Base | Representation |
---|---|
bin | 1010000100010111011001… |
… | …10010000110110000001111 |
3 | 2220101120210222022201222101 |
4 | 11002023230302012300033 |
5 | 10400221144401021143 |
6 | 115031025540255531 |
7 | 4443402431616106 |
oct | 502135462066017 |
9 | 86346728281871 |
10 | 22140234001423 |
11 | 706669099876a |
12 | 2596b136a15a7 |
13 | c47a79a3a775 |
14 | 56784344d03d |
15 | 285db93a8b4d |
hex | 1422ecc86c0f |
22140234001423 has 4 divisors (see below), whose sum is σ = 22140296185968. Its totient is φ = 22140171816880.
The previous prime is 22140234001409. The next prime is 22140234001429. The reversal of 22140234001423 is 32410043204122.
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-22140234001423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22140234001391 and 22140234001400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22140234001429) 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, 30555118 + ... + 31271323.
It is an arithmetic number, because the mean of its divisors is an integer number (5535074046492).
Almost surely, 222140234001423 is an apocalyptic number.
22140234001423 is a deficient number, since it is larger than the sum of its proper divisors (62184545).
22140234001423 is an equidigital number, since it uses as much as digits as its factorization.
22140234001423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62184544.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 22140234001423 its reverse (32410043204122), we get a palindrome (54550277205545).
The spelling of 22140234001423 in words is "twenty-two trillion, one hundred forty billion, two hundred thirty-four million, one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •