Base | Representation |
---|---|
bin | 1101010010100100000000… |
… | …1101110110110001010111 |
3 | 1220201221120011022202000012 |
4 | 3110221000031312301113 |
5 | 3403403003331140111 |
6 | 51024525434310435 |
7 | 3035502522413000 |
oct | 324510015666127 |
9 | 56657504282005 |
10 | 14612556115031 |
11 | 4724171a84256 |
12 | 178001758841b |
13 | 81cc5c017904 |
14 | 3873741321a7 |
15 | 1a518d23b48b |
hex | d4a40376c57 |
14612556115031 has 8 divisors (see below), whose sum is σ = 17040881767200. Its totient is φ = 12525048098304.
The previous prime is 14612556115019. The next prime is 14612556115037. The reversal of 14612556115031 is 13051165521641.
It is not a de Polignac number, because 14612556115031 - 26 = 14612556114967 is a prime.
It is a super-2 number, since 2×146125561150312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14612556115031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14612556115037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21301101866 + ... + 21301102551.
It is an arithmetic number, because the mean of its divisors is an integer number (2130110220900).
Almost surely, 214612556115031 is an apocalyptic number.
14612556115031 is a deficient number, since it is larger than the sum of its proper divisors (2428325652169).
14612556115031 is an frugal number, since it uses more digits than its factorization.
14612556115031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42602204438 (or 42602204424 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 41.
The spelling of 14612556115031 in words is "fourteen trillion, six hundred twelve billion, five hundred fifty-six million, one hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •