Base | Representation |
---|---|
bin | 1001001111000001100010… |
… | …0001011011101100111011 |
3 | 1022221200111210102212010211 |
4 | 2103300120201123230323 |
5 | 2312324301302331042 |
6 | 33332315111451551 |
7 | 2065403333600404 |
oct | 223603041335473 |
9 | 38850453385124 |
10 | 10153714105147 |
11 | 32651909a6358 |
12 | 117ba36386bb7 |
13 | 588650029822 |
14 | 271629c929ab |
15 | 1291c4b23017 |
hex | 93c1885bb3b |
10153714105147 has 2 divisors, whose sum is σ = 10153714105148. Its totient is φ = 10153714105146.
The previous prime is 10153714105133. The next prime is 10153714105187. The reversal of 10153714105147 is 74150141735101.
10153714105147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (10153714105187) can be obtained adding 10153714105147 to its sum of digits (40).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10153714105147 - 215 = 10153714072379 is a prime.
It is a super-2 number, since 2×101537141051472 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10153714105187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5076857052573 + 5076857052574.
It is an arithmetic number, because the mean of its divisors is an integer number (5076857052574).
Almost surely, 210153714105147 is an apocalyptic number.
10153714105147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10153714105147 is an equidigital number, since it uses as much as digits as its factorization.
10153714105147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 58800, while the sum is 40.
The spelling of 10153714105147 in words is "ten trillion, one hundred fifty-three billion, seven hundred fourteen million, one hundred five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •