Base | Representation |
---|---|
bin | 11101000110110101010… |
… | …10111110100101010111 |
3 | 10112121102202200110021112 |
4 | 32203122222332211113 |
5 | 112341201341042101 |
6 | 2043235021405235 |
7 | 132153303122441 |
oct | 16433252764527 |
9 | 3477382613245 |
10 | 1000101112151 |
11 | 356160006a59 |
12 | 1419aba0981b |
13 | 7340320b60b |
14 | 36595a47491 |
15 | 1b03558a6bb |
hex | e8daabe957 |
1000101112151 has 2 divisors, whose sum is σ = 1000101112152. Its totient is φ = 1000101112150.
The previous prime is 1000101112099. The next prime is 1000101112159. The reversal of 1000101112151 is 1512111010001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000101112151 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000101112159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500050556075 + 500050556076.
It is an arithmetic number, because the mean of its divisors is an integer number (500050556076).
Almost surely, 21000101112151 is an apocalyptic number.
1000101112151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000101112151 is an equidigital number, since it uses as much as digits as its factorization.
1000101112151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 1000101112151 its reverse (1512111010001), we get a palindrome (2512212122152).
The spelling of 1000101112151 in words is "one trillion, one hundred one million, one hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •