Base | Representation |
---|---|
bin | 1100000011100010111100… |
… | …1101001101000110100110 |
3 | 1201221011121222220011222012 |
4 | 3000320233031031012212 |
5 | 3214132331113104100 |
6 | 44105142504234222 |
7 | 2535434525033141 |
oct | 300705715150646 |
9 | 51834558804865 |
10 | 13255061066150 |
11 | 425049245a942 |
12 | 15a0b0516b972 |
13 | 751c404371b7 |
14 | 33b796a73058 |
15 | 17ebdb96b135 |
hex | c0e2f34d1a6 |
13255061066150 has 12 divisors (see below), whose sum is σ = 24654413583132. Its totient is φ = 5302024426440.
The previous prime is 13255061066141. The next prime is 13255061066153. The reversal of 13255061066150 is 5166016055231.
It is a junction number, because it is equal to n+sod(n) for n = 13255061066098 and 13255061066107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13255061066153) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 132550610612 + ... + 132550610711.
It is an arithmetic number, because the mean of its divisors is an integer number (2054534465261).
Almost surely, 213255061066150 is an apocalyptic number.
13255061066150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13255061066150 is a deficient number, since it is larger than the sum of its proper divisors (11399352516982).
13255061066150 is a wasteful number, since it uses less digits than its factorization.
13255061066150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265101221335 (or 265101221330 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 13255061066150 in words is "thirteen trillion, two hundred fifty-five billion, sixty-one million, sixty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •