Base | Representation |
---|---|
bin | 101110100111110011… |
… | …1100010010101011001 |
3 | 100120102112110120221002 |
4 | 1131033213202111121 |
5 | 3120021210341441 |
6 | 113554451154345 |
7 | 10143032030033 |
oct | 1351747422531 |
9 | 316375416832 |
10 | 100120012121 |
11 | 39508155a78 |
12 | 174a1ba59b5 |
13 | 959763c02c |
14 | 4bbad80c53 |
15 | 290ea43b9b |
hex | 174f9e2559 |
100120012121 has 4 divisors (see below), whose sum is σ = 100147881012. Its totient is φ = 100092143232.
The previous prime is 100120012093. The next prime is 100120012163. The reversal of 100120012121 is 121210021001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 121210021001 = 13219 ⋅9169379.
It can be written as a sum of positive squares in 2 ways, for example, as 10156608400 + 89963403721 = 100780^2 + 299939^2 .
It is a cyclic number.
It is not a de Polignac number, because 100120012121 - 210 = 100120011097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100120012171) 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, 13929056 + ... + 13936241.
It is an arithmetic number, because the mean of its divisors is an integer number (25036970253).
Almost surely, 2100120012121 is an apocalyptic number.
It is an amenable number.
100120012121 is a deficient number, since it is larger than the sum of its proper divisors (27868891).
100120012121 is an equidigital number, since it uses as much as digits as its factorization.
100120012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27868890.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100120012121 its reverse (121210021001), we get a palindrome (221330033122).
The spelling of 100120012121 in words is "one hundred billion, one hundred twenty million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •