Base | Representation |
---|---|
bin | 1001001011111101100110… |
… | …1110101100101010000111 |
3 | 1022202122202111020211010111 |
4 | 2102333121232230222013 |
5 | 2310444043434312221 |
6 | 33252220235133451 |
7 | 2061532123633402 |
oct | 222773156545207 |
9 | 38678674224114 |
10 | 10101121010311 |
11 | 3244952524821 |
12 | 11717b8ba4287 |
13 | 5836bac93b76 |
14 | 26cc7addad39 |
15 | 127b477b3be1 |
hex | 92fd9baca87 |
10101121010311 has 4 divisors (see below), whose sum is σ = 10101422273112. Its totient is φ = 10100819747512.
The previous prime is 10101121010293. The next prime is 10101121010333. The reversal of 10101121010311 is 11301012110101.
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 10101121010311 - 29 = 10101121009799 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10101121010291 and 10101121010300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101121010381) 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, 150581101 + ... + 150648166.
It is an arithmetic number, because the mean of its divisors is an integer number (2525355568278).
Almost surely, 210101121010311 is an apocalyptic number.
10101121010311 is a deficient number, since it is larger than the sum of its proper divisors (301262801).
10101121010311 is an equidigital number, since it uses as much as digits as its factorization.
10101121010311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301262800.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 10101121010311 its reverse (11301012110101), we get a palindrome (21402133120412).
The spelling of 10101121010311 in words is "ten trillion, one hundred one billion, one hundred twenty-one million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •