Base | Representation |
---|---|
bin | 11101011101000001001… |
… | …11110010111001100101 |
3 | 10120202011212022101120212 |
4 | 32232200213302321211 |
5 | 113040100044214341 |
6 | 2052524551305205 |
7 | 133054413633212 |
oct | 16564047627145 |
9 | 3522155271525 |
10 | 1012012101221 |
11 | 3602124a2380 |
12 | 14417497b205 |
13 | 74580aa9444 |
14 | 36da58d4b09 |
15 | 1b4d10c75eb |
hex | eba09f2e65 |
1012012101221 has 16 divisors (see below), whose sum is σ = 1131071594688. Its totient is φ = 897467548800.
The previous prime is 1012012101169. The next prime is 1012012101229. The reversal of 1012012101221 is 1221012102101.
It is a cyclic number.
It is not a de Polignac number, because 1012012101221 - 26 = 1012012101157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012012101196 and 1012012101205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012012101229) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3898535 + ... + 4150011.
It is an arithmetic number, because the mean of its divisors is an integer number (70691974668).
Almost surely, 21012012101221 is an apocalyptic number.
1012012101221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012012101221 is a deficient number, since it is larger than the sum of its proper divisors (119059493467).
1012012101221 is a wasteful number, since it uses less digits than its factorization.
1012012101221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260452.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1012012101221 its reverse (1221012102101), we get a palindrome (2233024203322).
The spelling of 1012012101221 in words is "one trillion, twelve billion, twelve million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •