Base | Representation |
---|---|
bin | 11101101011111001101… |
… | …10111000110000110101 |
3 | 10121111210200201220222012 |
4 | 32311330312320300311 |
5 | 113202431003342323 |
6 | 2100325451014005 |
7 | 133456413023312 |
oct | 16657466706065 |
9 | 3544720656865 |
10 | 1020002012213 |
11 | 3636425a97a8 |
12 | 14582473a305 |
13 | 752551c9322 |
14 | 37522ad3d09 |
15 | 1b7ec77d678 |
hex | ed7cdb8c35 |
1020002012213 has 4 divisors (see below), whose sum is σ = 1021564037388. Its totient is φ = 1018439987040.
The previous prime is 1020002012131. The next prime is 1020002012269. The reversal of 1020002012213 is 3122102000201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 139814670724 + 880187341489 = 373918^2 + 938183^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020002012213 - 230 = 1018928270389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020002015213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 781011608 + ... + 781012913.
It is an arithmetic number, because the mean of its divisors is an integer number (255391009347).
Almost surely, 21020002012213 is an apocalyptic number.
It is an amenable number.
1020002012213 is a deficient number, since it is larger than the sum of its proper divisors (1562025175).
1020002012213 is an equidigital number, since it uses as much as digits as its factorization.
1020002012213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1562025174.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1020002012213 its reverse (3122102000201), we get a palindrome (4142104012414).
The spelling of 1020002012213 in words is "one trillion, twenty billion, two million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •