Base | Representation |
---|---|
bin | 1101110000110011100101… |
… | …1010110110010001001111 |
3 | 1222120121200101010111201112 |
4 | 3130030321122312101033 |
5 | 3440411102034420101 |
6 | 52103334521002235 |
7 | 3121155236204642 |
oct | 334147132662117 |
9 | 58517611114645 |
10 | 15132133123151 |
11 | 4904557721700 |
12 | 184486092337b |
13 | 859c5300b855 |
14 | 3a45833ada59 |
15 | 1b394c8d46bb |
hex | dc3396b644f |
15132133123151 has 48 divisors (see below), whose sum is σ = 16937825329152. Its totient is φ = 13506669570240.
The previous prime is 15132133123031. The next prime is 15132133123153.
It is a happy number.
15132133123151 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 15132133123151 - 230 = 15131059381327 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15132133123153) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3857284076 + ... + 3857287998.
It is an arithmetic number, because the mean of its divisors is an integer number (352871361024).
Almost surely, 215132133123151 is an apocalyptic number.
15132133123151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
15132133123151 is a deficient number, since it is larger than the sum of its proper divisors (1805692206001).
15132133123151 is a wasteful number, since it uses less digits than its factorization.
15132133123151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6612 (or 6601 counting only the distinct ones).
The product of its digits is 8100, while the sum is 32.
It can be divided in two parts, 1513213 and 3123151, that added together give a palindrome (4636364).
The spelling of 15132133123151 in words is "fifteen trillion, one hundred thirty-two billion, one hundred thirty-three million, one hundred twenty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •