Base | Representation |
---|---|
bin | 10001011101110010001… |
… | …001101111000100101001 |
3 | 11020201221202210120010222 |
4 | 101131302021233010221 |
5 | 124131013010432223 |
6 | 2315211435415425 |
7 | 152466230300531 |
oct | 21356211570451 |
9 | 4221852716128 |
10 | 1200211030313 |
11 | 423008923309 |
12 | 1747382b4575 |
13 | 89244234809 |
14 | 4213a57c4c1 |
15 | 213484c30c8 |
hex | 1177226f129 |
1200211030313 has 2 divisors, whose sum is σ = 1200211030314. Its totient is φ = 1200211030312.
The previous prime is 1200211030307. The next prime is 1200211030349. The reversal of 1200211030313 is 3130301120021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 902971261504 + 297239768809 = 950248^2 + 545197^2 .
It is an emirp because it is prime and its reverse (3130301120021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1200211030313 - 210 = 1200211029289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1200211030291 and 1200211030300.
It is not a weakly prime, because it can be changed into another prime (1200211030303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600105515156 + 600105515157.
It is an arithmetic number, because the mean of its divisors is an integer number (600105515157).
Almost surely, 21200211030313 is an apocalyptic number.
It is an amenable number.
1200211030313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200211030313 is an equidigital number, since it uses as much as digits as its factorization.
1200211030313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1200211030313 its reverse (3130301120021), we get a palindrome (4330512150334).
The spelling of 1200211030313 in words is "one trillion, two hundred billion, two hundred eleven million, thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •