Base | Representation |
---|---|
bin | 1101101010000100001000… |
… | …0110000100111101010011 |
3 | 1222011112201210001201002101 |
4 | 3122201002012010331103 |
5 | 3432011403011244433 |
6 | 51534222155101231 |
7 | 3106615162503400 |
oct | 332410206047523 |
9 | 58145653051071 |
10 | 15016314556243 |
11 | 486a424102110 |
12 | 1826319441817 |
13 | 84c0561cc160 |
14 | 39cb175292a7 |
15 | 1b091ea9207d |
hex | da842184f53 |
15016314556243 has 48 divisors (see below), whose sum is σ = 20710070932320. Its totient is φ = 10701853747200.
The previous prime is 15016314556237. The next prime is 15016314556253. The reversal of 15016314556243 is 34265541361051.
It is not a de Polignac number, because 15016314556243 - 225 = 15016281001811 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15016314556193 and 15016314556202.
It is not an unprimeable number, because it can be changed into a prime (15016314556253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9066718 + ... + 10594243.
It is an arithmetic number, because the mean of its divisors is an integer number (431459811090).
Almost surely, 215016314556243 is an apocalyptic number.
15016314556243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
15016314556243 is a deficient number, since it is larger than the sum of its proper divisors (5693756376077).
15016314556243 is a wasteful number, since it uses less digits than its factorization.
15016314556243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19661108 (or 19661101 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 46.
The spelling of 15016314556243 in words is "fifteen trillion, sixteen billion, three hundred fourteen million, five hundred fifty-six thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •