Base | Representation |
---|---|
bin | 11101000110101010101… |
… | …11011101110100101111 |
3 | 10112121012120012201212012 |
4 | 32203111113131310233 |
5 | 112341011100024101 |
6 | 2043222122031435 |
7 | 132151142460344 |
oct | 16432527356457 |
9 | 3477176181765 |
10 | 1000012111151 |
11 | 356114848209 |
12 | 14198604857b |
13 | 733ba9492c1 |
14 | 36587cba7cb |
15 | 1b02c859bbb |
hex | e8d55ddd2f |
1000012111151 has 2 divisors, whose sum is σ = 1000012111152. Its totient is φ = 1000012111150.
The previous prime is 1000012111123. The next prime is 1000012111223. The reversal of 1000012111151 is 1511112100001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1000012111151 - 210 = 1000012110127 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 (1000012111121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500006055575 + 500006055576.
It is an arithmetic number, because the mean of its divisors is an integer number (500006055576).
Almost surely, 21000012111151 is an apocalyptic number.
1000012111151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000012111151 is an equidigital number, since it uses as much as digits as its factorization.
1000012111151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 1000012111151 its reverse (1511112100001), we get a palindrome (2511124211152).
The spelling of 1000012111151 in words is "one trillion, twelve million, one hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •