Base | Representation |
---|---|
bin | 11101011101010111110… |
… | …00110110010110110001 |
3 | 10120202200000222121020212 |
4 | 32232223320312112301 |
5 | 113040441441334301 |
6 | 2052555422513505 |
7 | 133062200366654 |
oct | 16565370662661 |
9 | 3522600877225 |
10 | 1012201121201 |
11 | 3602aa165936 |
12 | 144208135895 |
13 | 745b0cbaa9a |
14 | 36dc2a5989b |
15 | 1b4e29b34bb |
hex | ebabe365b1 |
1012201121201 has 4 divisors (see below), whose sum is σ = 1044852770304. Its totient is φ = 979549472100.
The previous prime is 1012201121167. The next prime is 1012201121219. The reversal of 1012201121201 is 1021211022101.
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 a cyclic number.
It is not a de Polignac number, because 1012201121201 - 218 = 1012200859057 is a prime.
It is a super-2 number, since 2×10122011212012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012201121221) 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, 16325824505 + ... + 16325824566.
It is an arithmetic number, because the mean of its divisors is an integer number (261213192576).
Almost surely, 21012201121201 is an apocalyptic number.
It is an amenable number.
1012201121201 is a deficient number, since it is larger than the sum of its proper divisors (32651649103).
1012201121201 is an equidigital number, since it uses as much as digits as its factorization.
1012201121201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32651649102.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1012201121201 its reverse (1021211022101), we get a palindrome (2033412143302).
The spelling of 1012201121201 in words is "one trillion, twelve billion, two hundred one million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •