Base | Representation |
---|---|
bin | 1001010111100110101000… |
… | …1100011100011111000111 |
3 | 1100110202222021212212121002 |
4 | 2111321222030130133013 |
5 | 2322233134441114421 |
6 | 33524133250243515 |
7 | 2112142121455244 |
oct | 225715214343707 |
9 | 40422867785532 |
10 | 10301113223111 |
11 | 331174a957317 |
12 | 11a4511b8659b |
13 | 5995107b7719 |
14 | 2788100525cb |
15 | 12ce501eab0b |
hex | 95e6a31c7c7 |
10301113223111 has 4 divisors (see below), whose sum is σ = 10303821907752. Its totient is φ = 10298404538472.
The previous prime is 10301113223081. The next prime is 10301113223117. The reversal of 10301113223111 is 11132231110301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10301113223111 is a prime.
It is a super-2 number, since 2×103011132231112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301113223117) 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, 1354336616 + ... + 1354344221.
It is an arithmetic number, because the mean of its divisors is an integer number (2575955476938).
Almost surely, 210301113223111 is an apocalyptic number.
10301113223111 is a deficient number, since it is larger than the sum of its proper divisors (2708684641).
10301113223111 is an equidigital number, since it uses as much as digits as its factorization.
10301113223111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2708684640.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10301113223111 its reverse (11132231110301), we get a palindrome (21433344333412).
The spelling of 10301113223111 in words is "ten trillion, three hundred one billion, one hundred thirteen million, two hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •