Base | Representation |
---|---|
bin | 11101011101010111110… |
… | …00011110001010101001 |
3 | 10120202200000210120100020 |
4 | 32232223320132022221 |
5 | 113040441430201441 |
6 | 2052555420431053 |
7 | 133062166505052 |
oct | 16565370361251 |
9 | 3522600716306 |
10 | 1012201022121 |
11 | 3602aa0a8453 |
12 | 1442080a8489 |
13 | 745b0c84963 |
14 | 36dc2a31729 |
15 | 1b4e2993e66 |
hex | ebabe1e2a9 |
1012201022121 has 8 divisors (see below), whose sum is σ = 1354207512000. Its totient is φ = 672497606832.
The previous prime is 1012201022113. The next prime is 1012201022143. The reversal of 1012201022121 is 1212201022101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012201022121 - 23 = 1012201022113 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1012201022121.
It is not an unprimeable number, because it can be changed into a prime (1012201022111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 575767621 + ... + 575769378.
It is an arithmetic number, because the mean of its divisors is an integer number (169275939000).
Almost surely, 21012201022121 is an apocalyptic number.
It is an amenable number.
1012201022121 is a deficient number, since it is larger than the sum of its proper divisors (342006489879).
1012201022121 is a wasteful number, since it uses less digits than its factorization.
1012201022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1151537295.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1012201022121 its reverse (1212201022101), we get a palindrome (2224402044222).
The spelling of 1012201022121 in words is "one trillion, twelve billion, two hundred one million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •