Base | Representation |
---|---|
bin | 1001001101001100100001… |
… | …0001101100011110101011 |
3 | 1022211200102200221222020002 |
4 | 2103103020101230132223 |
5 | 2311320434033444321 |
6 | 33310042151253215 |
7 | 2063212051064360 |
oct | 223231021543653 |
9 | 38750380858202 |
10 | 10122303031211 |
11 | 325293219a618 |
12 | 117592a97a20b |
13 | 5856b5509647 |
14 | 26dcca292467 |
15 | 1284871b820b |
hex | 934c846c7ab |
10122303031211 has 8 divisors (see below), whose sum is σ = 11568407134944. Its totient is φ = 8676214130880.
The previous prime is 10122303031199. The next prime is 10122303031213. The reversal of 10122303031211 is 11213030322101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122303031211 is a prime.
It is a super-2 number, since 2×101223030312112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10122303031213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2336540 + ... + 5069913.
It is an arithmetic number, because the mean of its divisors is an integer number (1446050891868).
Almost surely, 210122303031211 is an apocalyptic number.
10122303031211 is a deficient number, since it is larger than the sum of its proper divisors (1446104103733).
10122303031211 is an equidigital number, since it uses as much as digits as its factorization.
10122303031211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7601701.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10122303031211 its reverse (11213030322101), we get a palindrome (21335333353312).
The spelling of 10122303031211 in words is "ten trillion, one hundred twenty-two billion, three hundred three million, thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •