Base | Representation |
---|---|
bin | 1001001101111010001001… |
… | …0101111011110001010101 |
3 | 1022212212001022122011112101 |
4 | 2103132202111323301111 |
5 | 2312021030141310401 |
6 | 33315425414522101 |
7 | 2064124430326354 |
oct | 223364225736125 |
9 | 38785038564471 |
10 | 10134551510101 |
11 | 3258048136047 |
12 | 1178188966331 |
13 | 5868b7ca03a5 |
14 | 27072ccb199b |
15 | 12895266c101 |
hex | 937a257bc55 |
10134551510101 has 2 divisors, whose sum is σ = 10134551510102. Its totient is φ = 10134551510100.
The previous prime is 10134551510099. The next prime is 10134551510131. The reversal of 10134551510101 is 10101515543101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9641031210001 + 493520300100 = 3105001^2 + 702510^2 .
It is a cyclic number.
It is not a de Polignac number, because 10134551510101 - 21 = 10134551510099 is a prime.
Together with 10134551510099, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10134551510101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10134551510131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5067275755050 + 5067275755051.
It is an arithmetic number, because the mean of its divisors is an integer number (5067275755051).
Almost surely, 210134551510101 is an apocalyptic number.
It is an amenable number.
10134551510101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10134551510101 is an equidigital number, since it uses as much as digits as its factorization.
10134551510101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1500, while the sum is 28.
The spelling of 10134551510101 in words is "ten trillion, one hundred thirty-four billion, five hundred fifty-one million, five hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •