Base | Representation |
---|---|
bin | 1001001001111011100100… |
… | …11001011111101000000011 |
3 | 2122021122022201202110020221 |
4 | 10210331302121133220003 |
5 | 10114322204314031430 |
6 | 110452413334043511 |
7 | 4145343256663645 |
oct | 444756231375003 |
9 | 78248281673227 |
10 | 20132431002115 |
11 | 64621304a4023 |
12 | 23119724a9597 |
13 | b30631a0a353 |
14 | 4d85b4536895 |
15 | 24da5634657a |
hex | 124f7265fa03 |
20132431002115 has 8 divisors (see below), whose sum is σ = 24159089230128. Its totient is φ = 16105830116640.
The previous prime is 20132431002109. The next prime is 20132431002181. The reversal of 20132431002115 is 51120013423102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20132431002115 - 217 = 20132430871043 is a prime.
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 20132431002115.
It is an unprimeable number.
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, 13559412 + ... + 14970721.
It is an arithmetic number, because the mean of its divisors is an integer number (3019886153766).
Almost surely, 220132431002115 is an apocalyptic number.
20132431002115 is a deficient number, since it is larger than the sum of its proper divisors (4026658228013).
20132431002115 is a wasteful number, since it uses less digits than its factorization.
20132431002115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28671269.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 20132431002115 its reverse (51120013423102), we get a palindrome (71252444425217).
The spelling of 20132431002115 in words is "twenty trillion, one hundred thirty-two billion, four hundred thirty-one million, two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •