Base | Representation |
---|---|
bin | 1101110000110011100010… |
… | …1110001000010010111001 |
3 | 1222120121122120001221021110 |
4 | 3130030320232020102321 |
5 | 3440411041034304010 |
6 | 52103333421430533 |
7 | 3121155034442064 |
oct | 334147056102271 |
9 | 58517576057243 |
10 | 15132121400505 |
11 | 490455104526a |
12 | 1844858a0b449 |
13 | 859c50765b85 |
14 | 3a45819db8db |
15 | 1b394b86b120 |
hex | dc338b884b9 |
15132121400505 has 16 divisors (see below), whose sum is σ = 25635593902464. Its totient is φ = 7595731526400.
The previous prime is 15132121400419. The next prime is 15132121400509. The reversal of 15132121400505 is 50500412123151.
It is not a de Polignac number, because 15132121400505 - 227 = 15131987182777 is a prime.
It is a super-2 number, since 2×151321214005052 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (15132121400509) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29670826021 + ... + 29670826530.
It is an arithmetic number, because the mean of its divisors is an integer number (1602224618904).
Almost surely, 215132121400505 is an apocalyptic number.
15132121400505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
15132121400505 is a deficient number, since it is larger than the sum of its proper divisors (10503472501959).
15132121400505 is a wasteful number, since it uses less digits than its factorization.
15132121400505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59341652576.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 15132121400505 its reverse (50500412123151), we get a palindrome (65632533523656).
The spelling of 15132121400505 in words is "fifteen trillion, one hundred thirty-two billion, one hundred twenty-one million, four hundred thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •