Base | Representation |
---|---|
bin | 10111001100011100010101… |
… | …000010000100010111100011 |
3 | 111101012001221201211002110011 |
4 | 113030130111002010113203 |
5 | 101332313212001023021 |
6 | 1000542445214145351 |
7 | 30325662616521511 |
oct | 2714342502042743 |
9 | 441161851732404 |
10 | 102010121111011 |
11 | 2a55a281a72513 |
12 | b5362b31b2257 |
13 | 44bc6894c02a9 |
14 | 1b2945d94d4b1 |
15 | bbd7b60cede1 |
hex | 5cc7150845e3 |
102010121111011 has 4 divisors (see below), whose sum is σ = 102010146517224. Its totient is φ = 102010095704800.
The previous prime is 102010121110943. The next prime is 102010121111021. The reversal of 102010121111011 is 110111121010201.
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 102010121111011 - 235 = 101975761372643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102010121110982 and 102010121111000.
It is not an unprimeable number, because it can be changed into a prime (102010121111021) 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, 5205145 + ... + 15202426.
It is an arithmetic number, because the mean of its divisors is an integer number (25502536629306).
Almost surely, 2102010121111011 is an apocalyptic number.
102010121111011 is a deficient number, since it is larger than the sum of its proper divisors (25406213).
102010121111011 is an equidigital number, since it uses as much as digits as its factorization.
102010121111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25406212.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 102010121111011 its reverse (110111121010201), we get a palindrome (212121242121212).
The spelling of 102010121111011 in words is "one hundred two trillion, ten billion, one hundred twenty-one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •