Base | Representation |
---|---|
bin | 1001001110111000001101… |
… | …1001000110111101011101 |
3 | 1022221110001102111201210202 |
4 | 2103232003121012331131 |
5 | 2312304140300232403 |
6 | 33331222533313245 |
7 | 2065254333213662 |
oct | 223560331067535 |
9 | 38843042451722 |
10 | 10151212117853 |
11 | 3264117665264 |
12 | 117b458495825 |
13 | 588341882981 |
14 | 27146d885a69 |
15 | 1290ca153688 |
hex | 93b83646f5d |
10151212117853 has 2 divisors, whose sum is σ = 10151212117854. Its totient is φ = 10151212117852.
The previous prime is 10151212117847. The next prime is 10151212117903. The reversal of 10151212117853 is 35871121215101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8068769751364 + 2082442366489 = 2840558^2 + 1443067^2 .
It is an emirp because it is prime and its reverse (35871121215101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10151212117853 - 26 = 10151212117789 is a prime.
It is a super-2 number, since 2×101512121178532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10151212117153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5075606058926 + 5075606058927.
It is an arithmetic number, because the mean of its divisors is an integer number (5075606058927).
Almost surely, 210151212117853 is an apocalyptic number.
It is an amenable number.
10151212117853 is a deficient number, since it is larger than the sum of its proper divisors (1).
10151212117853 is an equidigital number, since it uses as much as digits as its factorization.
10151212117853 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16800, while the sum is 38.
The spelling of 10151212117853 in words is "ten trillion, one hundred fifty-one billion, two hundred twelve million, one hundred seventeen thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •