Base | Representation |
---|---|
bin | 1001001100100111101010… |
… | …1111010101010101110001 |
3 | 1022210201220101200212221101 |
4 | 2103021322233111111301 |
5 | 2311140210013241223 |
6 | 33301324505324401 |
7 | 2062412000553142 |
oct | 223117257252561 |
9 | 38721811625841 |
10 | 10112412243313 |
11 | 3249717099246 |
12 | 1173a2a496701 |
13 | 58479a339a23 |
14 | 26d62c83bac9 |
15 | 1280a8bce4ad |
hex | 9327abd5571 |
10112412243313 has 8 divisors (see below), whose sum is σ = 10196168716800. Its totient is φ = 10028958687408.
The previous prime is 10112412243301. The next prime is 10112412243331. The reversal of 10112412243313 is 31334221421101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10112412243313 is a prime.
It is a super-2 number, since 2×101124122433132 (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 (10112412243343) 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, 75662353 + ... + 75795886.
It is an arithmetic number, because the mean of its divisors is an integer number (1274521089600).
Almost surely, 210112412243313 is an apocalyptic number.
It is an amenable number.
10112412243313 is a deficient number, since it is larger than the sum of its proper divisors (83756473487).
10112412243313 is a wasteful number, since it uses less digits than its factorization.
10112412243313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151458791.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 10112412243313 its reverse (31334221421101), we get a palindrome (41446633664414).
The spelling of 10112412243313 in words is "ten trillion, one hundred twelve billion, four hundred twelve million, two hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •