Base | Representation |
---|---|
bin | 11110000000011011001… |
… | …01111110111110010001 |
3 | 10122120020120102110202222 |
4 | 33000031211332332101 |
5 | 113343012133241423 |
6 | 2105351045150425 |
7 | 134326433130143 |
oct | 17001545767621 |
9 | 3576216373688 |
10 | 1031020212113 |
11 | 368287038431 |
12 | 14799a6bb415 |
13 | 762bcb26938 |
14 | 37c8a180c93 |
15 | 1bc44c153c8 |
hex | f00d97ef91 |
1031020212113 has 2 divisors, whose sum is σ = 1031020212114. Its totient is φ = 1031020212112.
The previous prime is 1031020212037. The next prime is 1031020212121. The reversal of 1031020212113 is 3112120201301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 615829423504 + 415190788609 = 784748^2 + 644353^2 .
It is an emirp because it is prime and its reverse (3112120201301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1031020212113 - 238 = 756142305169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1031020212091 and 1031020212100.
It is not a weakly prime, because it can be changed into another prime (1031020212133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515510106056 + 515510106057.
It is an arithmetic number, because the mean of its divisors is an integer number (515510106057).
Almost surely, 21031020212113 is an apocalyptic number.
It is an amenable number.
1031020212113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031020212113 is an equidigital number, since it uses as much as digits as its factorization.
1031020212113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1031020212113 its reverse (3112120201301), we get a palindrome (4143140413414).
The spelling of 1031020212113 in words is "one trillion, thirty-one billion, twenty million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •