Base | Representation |
---|---|
bin | 1001001100101010111111… |
… | …0001100001110101011111 |
3 | 1022210211012101221210001201 |
4 | 2103022233301201311133 |
5 | 2311144020303324411 |
6 | 33301553052220331 |
7 | 2062443023504536 |
oct | 223125761416537 |
9 | 38724171853051 |
10 | 10113302011231 |
11 | 324a033372031 |
12 | 117403846a6a7 |
13 | 5848ac790013 |
14 | 26d6b4a9331d |
15 | 12810bd893c1 |
hex | 932afc61d5f |
10113302011231 has 16 divisors (see below), whose sum is σ = 10744073968320. Its totient is φ = 9500022766080.
The previous prime is 10113302011229. The next prime is 10113302011273. The reversal of 10113302011231 is 13211020331101.
It is a cyclic number.
It is not a de Polignac number, because 10113302011231 - 21 = 10113302011229 is a prime.
It is a super-2 number, since 2×101133020112312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10113302011199 and 10113302011208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113302011331) 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, 17566380 + ... + 18132961.
It is an arithmetic number, because the mean of its divisors is an integer number (671504623020).
Almost surely, 210113302011231 is an apocalyptic number.
10113302011231 is a deficient number, since it is larger than the sum of its proper divisors (630771957089).
10113302011231 is a wasteful number, since it uses less digits than its factorization.
10113302011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35699586.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10113302011231 its reverse (13211020331101), we get a palindrome (23324322342332).
The spelling of 10113302011231 in words is "ten trillion, one hundred thirteen billion, three hundred two million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •