Base | Representation |
---|---|
bin | 10111001100011110001100… |
… | …001011101100000001001101 |
3 | 111101012021010001022100012202 |
4 | 113030132030023230001031 |
5 | 101332331310222341141 |
6 | 1000543415424011245 |
7 | 30326063302032266 |
oct | 2714361413540115 |
9 | 441167101270182 |
10 | 102012120121421 |
11 | 2a5601083a3634 |
12 | b536770760b25 |
13 | 44bc9176ac0a3 |
14 | 1b295ad22b96d |
15 | bbd88184949b |
hex | 5cc78c2ec04d |
102012120121421 has 16 divisors (see below), whose sum is σ = 107430882345600. Its totient is φ = 96598337038848.
The previous prime is 102012120121381. The next prime is 102012120121441. The reversal of 102012120121421 is 124121021210201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102012120121421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102012120121393 and 102012120121402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102012120121441) 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, 435193976 + ... + 435428318.
It is an arithmetic number, because the mean of its divisors is an integer number (6714430146600).
Almost surely, 2102012120121421 is an apocalyptic number.
It is an amenable number.
102012120121421 is a deficient number, since it is larger than the sum of its proper divisors (5418762224179).
102012120121421 is a wasteful number, since it uses less digits than its factorization.
102012120121421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244868.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 102012120121421 its reverse (124121021210201), we get a palindrome (226133141331622).
The spelling of 102012120121421 in words is "one hundred two trillion, twelve billion, one hundred twenty million, one hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.925 sec. • engine limits •