Base | Representation |
---|---|
bin | 11110000000011010001… |
… | …10101101000010110101 |
3 | 10122120012222222212121222 |
4 | 33000031012231002311 |
5 | 113343003033342323 |
6 | 2105350153320125 |
7 | 134326303335551 |
oct | 17001506550265 |
9 | 3576188885558 |
10 | 1031012012213 |
11 | 368282447757 |
12 | 147997a06045 |
13 | 762bb215521 |
14 | 37c89048861 |
15 | 1bc441459c8 |
hex | f00d1ad0b5 |
1031012012213 has 2 divisors, whose sum is σ = 1031012012214. Its totient is φ = 1031012012212.
The previous prime is 1031012012209. The next prime is 1031012012333. The reversal of 1031012012213 is 3122102101301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1025810429329 + 5201582884 = 1012823^2 + 72122^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031012012213 - 22 = 1031012012209 is a prime.
It is a super-2 number, since 2×10310120122132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031012012191 and 1031012012200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1031012012113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515506006106 + 515506006107.
It is an arithmetic number, because the mean of its divisors is an integer number (515506006107).
Almost surely, 21031012012213 is an apocalyptic number.
It is an amenable number.
1031012012213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031012012213 is an equidigital number, since it uses as much as digits as its factorization.
1031012012213 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 1031012012213 its reverse (3122102101301), we get a palindrome (4153114113514).
The spelling of 1031012012213 in words is "one trillion, thirty-one billion, twelve million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •