Base | Representation |
---|---|
bin | 11101011001010010110… |
… | …10011100000101111111 |
3 | 10120120000110222101002112 |
4 | 32230221122130011333 |
5 | 113022001100024411 |
6 | 2051554304444235 |
7 | 132654020202464 |
oct | 16545132340577 |
9 | 3516013871075 |
10 | 1010012111231 |
11 | 35a386562292 |
12 | 1438b701967b |
13 | 74322636806 |
14 | 36c5603d66b |
15 | 1b415717b8b |
hex | eb2969c17f |
1010012111231 has 2 divisors, whose sum is σ = 1010012111232. Its totient is φ = 1010012111230.
The previous prime is 1010012111221. The next prime is 1010012111233. The reversal of 1010012111231 is 1321112100101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1010012111231 - 230 = 1008938369407 is a prime.
It is a super-3 number, since 3×10100121112313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 1010012111233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010012111233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505006055615 + 505006055616.
It is an arithmetic number, because the mean of its divisors is an integer number (505006055616).
Almost surely, 21010012111231 is an apocalyptic number.
1010012111231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010012111231 is an equidigital number, since it uses as much as digits as its factorization.
1010012111231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1010012111231 its reverse (1321112100101), we get a palindrome (2331124211332).
The spelling of 1010012111231 in words is "one trillion, ten billion, twelve million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •