Base | Representation |
---|---|
bin | 100011011110010000001001… |
… | …1011011001000101001100111 |
3 | 1111220202221000122012210221222 |
4 | 1012330200103123020221213 |
5 | 311344123213130001411 |
6 | 3023340304042530555 |
7 | 122502531656522552 |
oct | 10674402333105147 |
9 | 1456687018183858 |
10 | 312021110000231 |
11 | 90468456248a05 |
12 | 2abb3946506a5b |
13 | 105146064419a8 |
14 | 5709c8bcbd699 |
15 | 26115b9ba94db |
hex | 11bc8136c8a67 |
312021110000231 has 2 divisors, whose sum is σ = 312021110000232. Its totient is φ = 312021110000230.
The previous prime is 312021110000189. The next prime is 312021110000263. The reversal of 312021110000231 is 132000011120213.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312021110000231 is a prime.
It is a super-2 number, since 2×3120211100002312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312021110600231) 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, 156010555000115 + 156010555000116.
It is an arithmetic number, because the mean of its divisors is an integer number (156010555000116).
Almost surely, 2312021110000231 is an apocalyptic number.
312021110000231 is a deficient number, since it is larger than the sum of its proper divisors (1).
312021110000231 is an equidigital number, since it uses as much as digits as its factorization.
312021110000231 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 17.
Adding to 312021110000231 its reverse (132000011120213), we get a palindrome (444021121120444).
The spelling of 312021110000231 in words is "three hundred twelve trillion, twenty-one billion, one hundred ten million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •