Base | Representation |
---|---|
bin | 10110110000111100000001… |
… | …001010010100110111101001 |
3 | 111010111101020002110220111212 |
4 | 112300330001022110313221 |
5 | 101110331231020334233 |
6 | 552534254412402505 |
7 | 30042300662301005 |
oct | 2660740112246751 |
9 | 433441202426455 |
10 | 100120002121193 |
11 | 299a072208aa4a |
12 | b28bb16176435 |
13 | 43b33778c3952 |
14 | 1aa1b9654b705 |
15 | b8953ea43a48 |
hex | 5b0f01294de9 |
100120002121193 has 2 divisors, whose sum is σ = 100120002121194. Its totient is φ = 100120002121192.
The previous prime is 100120002121147. The next prime is 100120002121301. The reversal of 100120002121193 is 391121200021001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91397271076864 + 8722731044329 = 9560192^2 + 2953427^2 .
It is an emirp because it is prime and its reverse (391121200021001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100120002121193 - 230 = 100118928379369 is a prime.
It is not a weakly prime, because it can be changed into another prime (100120002121793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060001060596 + 50060001060597.
It is an arithmetic number, because the mean of its divisors is an integer number (50060001060597).
Almost surely, 2100120002121193 is an apocalyptic number.
It is an amenable number.
100120002121193 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120002121193 is an equidigital number, since it uses as much as digits as its factorization.
100120002121193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 100120002121193 its reverse (391121200021001), we get a palindrome (491241202142194).
The spelling of 100120002121193 in words is "one hundred trillion, one hundred twenty billion, two million, one hundred twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •