Base | Representation |
---|---|
bin | 1001001100101010111111… |
… | …0101110011001111110011 |
3 | 1022210211012111001200021012 |
4 | 2103022233311303033303 |
5 | 2311144021100143443 |
6 | 33301553132221135 |
7 | 2062443036150533 |
oct | 223125765631763 |
9 | 38724174050235 |
10 | 10113303131123 |
11 | 324a033a67465 |
12 | 117403890a7ab |
13 | 5848aca9298a |
14 | 26d6b4ca54c3 |
15 | 12810c00b118 |
hex | 932afd733f3 |
10113303131123 has 8 divisors (see below), whose sum is σ = 10214433693696. Its totient is φ = 10012674457800.
The previous prime is 10113303131047. The next prime is 10113303131159. The reversal of 10113303131123 is 32113130331101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10113303131123 - 216 = 10113303065587 is a prime.
It is a super-2 number, since 2×101133031311232 (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 (10113303133123) 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, 125431811 + ... + 125512412.
It is an arithmetic number, because the mean of its divisors is an integer number (1276804211712).
Almost surely, 210113303131123 is an apocalyptic number.
10113303131123 is a deficient number, since it is larger than the sum of its proper divisors (101130562573).
10113303131123 is a wasteful number, since it uses less digits than its factorization.
10113303131123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250944625.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 10113303131123 its reverse (32113130331101), we get a palindrome (42226433462224).
The spelling of 10113303131123 in words is "ten trillion, one hundred thirteen billion, three hundred three million, one hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •