Base | Representation |
---|---|
bin | 1010001100100101000001… |
… | …0111100101000110100011 |
3 | 1110200210002201011211122201 |
4 | 2203021100113211012203 |
5 | 2432141031012013443 |
6 | 35502205443114031 |
7 | 2234661211106602 |
oct | 243112027450643 |
9 | 43623081154581 |
10 | 11211213001123 |
11 | 3632715510893 |
12 | 1310984672917 |
13 | 63429c827725 |
14 | 2aa8a8931a39 |
15 | 14696924434d |
hex | a32505e51a3 |
11211213001123 has 2 divisors, whose sum is σ = 11211213001124. Its totient is φ = 11211213001122.
The previous prime is 11211213001111. The next prime is 11211213001129. The reversal of 11211213001123 is 32110031211211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11211213001123 - 25 = 11211213001091 is a prime.
It is a super-2 number, since 2×112112130011232 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11211213001123.
It is not a weakly prime, because it can be changed into another prime (11211213001129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605606500561 + 5605606500562.
It is an arithmetic number, because the mean of its divisors is an integer number (5605606500562).
Almost surely, 211211213001123 is an apocalyptic number.
11211213001123 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211213001123 is an equidigital number, since it uses as much as digits as its factorization.
11211213001123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 11211213001123 its reverse (32110031211211), we get a palindrome (43321244212334).
The spelling of 11211213001123 in words is "eleven trillion, two hundred eleven billion, two hundred thirteen million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •