Base | Representation |
---|---|
bin | 1001001100000001010101… |
… | …0010000000001010110011 |
3 | 1022202202100010020220100111 |
4 | 2103000111102000022303 |
5 | 2311003120222333021 |
6 | 33252503325402151 |
7 | 2061565645141522 |
oct | 223002522001263 |
9 | 38682303226314 |
10 | 10102120121011 |
11 | 32453154a0446 |
12 | 1171a37709357 |
13 | 583819c7c329 |
14 | 26cd339964b9 |
15 | 127ba536b8e1 |
hex | 930154802b3 |
10102120121011 has 4 divisors (see below), whose sum is σ = 10541342734992. Its totient is φ = 9662897507032.
The previous prime is 10102120120979. The next prime is 10102120121033. The reversal of 10102120121011 is 11012102120101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10102120121011 - 25 = 10102120120979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10102120120982 and 10102120121000.
It is not an unprimeable number, because it can be changed into a prime (10102120121111) 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, 219611306956 + ... + 219611307001.
It is an arithmetic number, because the mean of its divisors is an integer number (2635335683748).
Almost surely, 210102120121011 is an apocalyptic number.
10102120121011 is a deficient number, since it is larger than the sum of its proper divisors (439222613981).
10102120121011 is an equidigital number, since it uses as much as digits as its factorization.
10102120121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439222613980.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10102120121011 its reverse (11012102120101), we get a palindrome (21114222241112).
The spelling of 10102120121011 in words is "ten trillion, one hundred two billion, one hundred twenty million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •