Base | Representation |
---|---|
bin | 1001000110011011100010… |
… | …01010100011011101001111 |
3 | 2121212010212020010122112101 |
4 | 10203031301022203131033 |
5 | 10110334341203133033 |
6 | 110321242205015531 |
7 | 4133554522514221 |
oct | 443156112433517 |
9 | 77763766118471 |
10 | 20012151224143 |
11 | 6416118717641 |
12 | 22b25a4b545a7 |
13 | b221a38856b0 |
14 | 4d2843da2411 |
15 | 24a866a2897d |
hex | 1233712a374f |
20012151224143 has 8 divisors (see below), whose sum is σ = 21551938579808. Its totient is φ = 18472419741024.
The previous prime is 20012151224101. The next prime is 20012151224189. The reversal of 20012151224143 is 34142215121002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20012151224143 - 225 = 20012117669711 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20012151224743) 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, 13222755 + ... + 14658292.
It is an arithmetic number, because the mean of its divisors is an integer number (2693992322476).
Almost surely, 220012151224143 is an apocalyptic number.
20012151224143 is a deficient number, since it is larger than the sum of its proper divisors (1539787355665).
20012151224143 is a wasteful number, since it uses less digits than its factorization.
20012151224143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27936273.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 20012151224143 its reverse (34142215121002), we get a palindrome (54154366345145).
The spelling of 20012151224143 in words is "twenty trillion, twelve billion, one hundred fifty-one million, two hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •