Base | Representation |
---|---|
bin | 1001001100101010001111… |
… | …1010110111101001111110 |
3 | 1022210210200112201201211210 |
4 | 2103022203322313221332 |
5 | 2311143113400231220 |
6 | 33301521225425250 |
7 | 2062435060202532 |
oct | 223124372675176 |
9 | 38723615651753 |
10 | 10113103133310 |
11 | 3249a41086111 |
12 | 1173ba193b226 |
13 | 58487a509688 |
14 | 26d6964c3bc2 |
15 | 1280e96a26e0 |
hex | 932a3eb7a7e |
10113103133310 has 16 divisors (see below), whose sum is σ = 24271447520016. Its totient is φ = 2696827502208.
The previous prime is 10113103133299. The next prime is 10113103133311. The reversal of 10113103133310 is 1333130131101.
It is a super-2 number, since 2×101131031333102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113103133311) 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, 168551718859 + ... + 168551718918.
It is an arithmetic number, because the mean of its divisors is an integer number (1516965470001).
Almost surely, 210113103133310 is an apocalyptic number.
10113103133310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10113103133310 is an abundant number, since it is smaller than the sum of its proper divisors (14158344386706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113103133310 is a wasteful number, since it uses less digits than its factorization.
10113103133310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337103437787.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 10113103133310 its reverse (1333130131101), we get a palindrome (11446233264411).
The spelling of 10113103133310 in words is "ten trillion, one hundred thirteen billion, one hundred three million, one hundred thirty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •