Base | Representation |
---|---|
bin | 1001001101101100111011… |
… | …0010100000010111000011 |
3 | 1022212111212222001001211122 |
4 | 2103123032302200113003 |
5 | 2311441243032331321 |
6 | 33314041305302455 |
7 | 2063640452051522 |
oct | 223331662402703 |
9 | 38774788031748 |
10 | 10131002230211 |
11 | 325659670a585 |
12 | 1177558194a2b |
13 | 58647086b385 |
14 | 2704b37664b9 |
15 | 1287e5c788ab |
hex | 936ceca05c3 |
10131002230211 has 16 divisors (see below), whose sum is σ = 10425963195648. Its totient is φ = 9838347532800.
The previous prime is 10131002230207. The next prime is 10131002230231. The reversal of 10131002230211 is 11203220013101.
It is a cyclic number.
It is not a de Polignac number, because 10131002230211 - 22 = 10131002230207 is a prime.
It is a super-2 number, since 2×101310022302112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10131002230211.
It is not an unprimeable number, because it can be changed into a prime (10131002230231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30086921 + ... + 30421781.
It is an arithmetic number, because the mean of its divisors is an integer number (651622699728).
Almost surely, 210131002230211 is an apocalyptic number.
10131002230211 is a deficient number, since it is larger than the sum of its proper divisors (294960965437).
10131002230211 is a wasteful number, since it uses less digits than its factorization.
10131002230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338302.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10131002230211 its reverse (11203220013101), we get a palindrome (21334222243312).
The spelling of 10131002230211 in words is "ten trillion, one hundred thirty-one billion, two million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •