Base | Representation |
---|---|
bin | 11101011101000000000… |
… | …01101001101110111001 |
3 | 10120202011011111101111210 |
4 | 32232200001221232321 |
5 | 113040040014232301 |
6 | 2052523553113333 |
7 | 133054232636436 |
oct | 16564001515671 |
9 | 3522134441453 |
10 | 1012002102201 |
11 | 360207892a22 |
12 | 144171558849 |
13 | 7457b9b816c |
14 | 36da4450b8d |
15 | 1b4d029ead6 |
hex | eba0069bb9 |
1012002102201 has 4 divisors (see below), whose sum is σ = 1349336136272. Its totient is φ = 674668068132.
The previous prime is 1012002102169. The next prime is 1012002102229. The reversal of 1012002102201 is 1022012002101.
1012002102201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1012002102201 - 25 = 1012002102169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012002100201) 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, 168667017031 + ... + 168667017036.
It is an arithmetic number, because the mean of its divisors is an integer number (337334034068).
Almost surely, 21012002102201 is an apocalyptic number.
It is an amenable number.
1012002102201 is a deficient number, since it is larger than the sum of its proper divisors (337334034071).
1012002102201 is an equidigital number, since it uses as much as digits as its factorization.
1012002102201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337334034070.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1012002102201 its reverse (1022012002101), we get a palindrome (2034014104302).
The spelling of 1012002102201 in words is "one trillion, twelve billion, two million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •