Base | Representation |
---|---|
bin | 1010000000111111101011… |
… | …1011001110101010110111 |
3 | 1102222202102220211021021121 |
4 | 2200033322323032222313 |
5 | 2420411002004311411 |
6 | 35230535003524411 |
7 | 2214414566102254 |
oct | 240177273165267 |
9 | 42882386737247 |
10 | 11012211010231 |
11 | 3566286033702 |
12 | 129a2a7229707 |
13 | 61b5a71c94b2 |
14 | 2a0dcb20042b |
15 | 1416bd70b571 |
hex | a03faeceab7 |
11012211010231 has 2 divisors, whose sum is σ = 11012211010232. Its totient is φ = 11012211010230.
The previous prime is 11012211010189. The next prime is 11012211010247. The reversal of 11012211010231 is 13201011221011.
It is a happy number.
It is an a-pointer prime, because the next prime (11012211010247) can be obtained adding 11012211010231 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11012211010231 - 215 = 11012210977463 is a prime.
It is a super-2 number, since 2×110122110102312 (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 (11012211010261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506105505115 + 5506105505116.
It is an arithmetic number, because the mean of its divisors is an integer number (5506105505116).
Almost surely, 211012211010231 is an apocalyptic number.
11012211010231 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012211010231 is an equidigital number, since it uses as much as digits as its factorization.
11012211010231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 11012211010231 its reverse (13201011221011), we get a palindrome (24213222231242).
The spelling of 11012211010231 in words is "eleven trillion, twelve billion, two hundred eleven million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •