Base | Representation |
---|---|
bin | 100011011111100100011111… |
… | …0000001011111011001111011 |
3 | 1111221102020111001001220110011 |
4 | 1012333020332001133121323 |
5 | 311410110113102340121 |
6 | 3023555414455402351 |
7 | 122521602613422334 |
oct | 10677107601373173 |
9 | 1457366431056404 |
10 | 312202213324411 |
11 | 90528240365953 |
12 | 2b022a696833b7 |
13 | 1052870882bc87 |
14 | 571494c44128b |
15 | 26161691a37e1 |
hex | 11bf23e05f67b |
312202213324411 has 2 divisors, whose sum is σ = 312202213324412. Its totient is φ = 312202213324410.
The previous prime is 312202213324327. The next prime is 312202213324483. The reversal of 312202213324411 is 114423312202213.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 312202213324411 - 225 = 312202179769979 is a prime.
It is a super-2 number, since 2×3122022133244112 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (312202213324811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156101106662205 + 156101106662206.
It is an arithmetic number, because the mean of its divisors is an integer number (156101106662206).
Almost surely, 2312202213324411 is an apocalyptic number.
312202213324411 is a deficient number, since it is larger than the sum of its proper divisors (1).
312202213324411 is an equidigital number, since it uses as much as digits as its factorization.
312202213324411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 312202213324411 its reverse (114423312202213), we get a palindrome (426625525526624).
The spelling of 312202213324411 in words is "three hundred twelve trillion, two hundred two billion, two hundred thirteen million, three hundred twenty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •