Base | Representation |
---|---|
bin | 1101110000110011100010… |
… | …1101100011110110011110 |
3 | 1222120121122112210100111202 |
4 | 3130030320231203312132 |
5 | 3440411041020014410 |
6 | 52103333414315502 |
7 | 3121155033250634 |
oct | 334147055436636 |
9 | 58517575710452 |
10 | 15132121251230 |
11 | 4904550a530a5 |
12 | 1844858958b92 |
13 | 859c50712c49 |
14 | 3a458199d354 |
15 | 1b394b83bca5 |
hex | dc338b63d9e |
15132121251230 has 64 divisors (see below), whose sum is σ = 27756156384000. Its totient is φ = 5938961430528.
The previous prime is 15132121251223. The next prime is 15132121251251. The reversal of 15132121251230 is 3215212123151.
It is a junction number, because it is equal to n+sod(n) for n = 15132121251193 and 15132121251202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 60952091 + ... + 61199849.
It is an arithmetic number, because the mean of its divisors is an integer number (433689943500).
Almost surely, 215132121251230 is an apocalyptic number.
15132121251230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15132121251230 is a deficient number, since it is larger than the sum of its proper divisors (12624035132770).
15132121251230 is a wasteful number, since it uses less digits than its factorization.
15132121251230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248421.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 15132121251230 its reverse (3215212123151), we get a palindrome (18347333374381).
The spelling of 15132121251230 in words is "fifteen trillion, one hundred thirty-two billion, one hundred twenty-one million, two hundred fifty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •