Base | Representation |
---|---|
bin | 10001111001101101101… |
… | …101100100110001100111 |
3 | 11100121100211210122012000 |
4 | 101321231231210301213 |
5 | 130123423013412221 |
6 | 2341051403300343 |
7 | 154610351414301 |
oct | 21715555446147 |
9 | 4317324718160 |
10 | 1230201310311 |
11 | 4347a8628586 |
12 | 17a507b1a6b3 |
13 | 8c0135a561c |
14 | 437835b6971 |
15 | 2200132be26 |
hex | 11e6db64c67 |
1230201310311 has 8 divisors (see below), whose sum is σ = 1822520459760. Its totient is φ = 820134206856.
The previous prime is 1230201310301. The next prime is 1230201310313. The reversal of 1230201310311 is 1130131020321.
1230201310311 is a `hidden beast` number, since 1 + 23 + 0 + 20 + 1 + 310 + 311 = 666.
It is a de Polignac number, because none of the positive numbers 2k-1230201310311 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230201310313) 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 in 7 ways as a sum of consecutive naturals, for example, 22781505720 + ... + 22781505773.
It is an arithmetic number, because the mean of its divisors is an integer number (227815057470).
Almost surely, 21230201310311 is an apocalyptic number.
1230201310311 is a deficient number, since it is larger than the sum of its proper divisors (592319149449).
1230201310311 is an equidigital number, since it uses as much as digits as its factorization.
1230201310311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45563011502 (or 45563011496 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1230201310311 its reverse (1130131020321), we get a palindrome (2360332330632).
The spelling of 1230201310311 in words is "one trillion, two hundred thirty billion, two hundred one million, three hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •