Base | Representation |
---|---|
bin | 1001001101000100000011… |
… | …0110101010100000111001 |
3 | 1022211110120100202220021221 |
4 | 2103101000312222200321 |
5 | 2311301310420133423 |
6 | 33305024510232041 |
7 | 2063101542240256 |
oct | 223210066524071 |
9 | 38743510686257 |
10 | 10120031021113 |
11 | 3251976756822 |
12 | 11753b5ab5621 |
13 | 5854128b4580 |
14 | 26db5262c42d |
15 | 1283a29c4e5d |
hex | 93440daa839 |
10120031021113 has 8 divisors (see below), whose sum is σ = 10898528482688. Its totient is φ = 9341538350544.
The previous prime is 10120031021101. The next prime is 10120031021119. The reversal of 10120031021113 is 31112013002101.
It is a happy number.
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 10120031021113 - 213 = 10120031012921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10120031021119) 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, 4036570 + ... + 6044332.
It is an arithmetic number, because the mean of its divisors is an integer number (1362316060336).
Almost surely, 210120031021113 is an apocalyptic number.
10120031021113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10120031021113 is a deficient number, since it is larger than the sum of its proper divisors (778497461575).
10120031021113 is a wasteful number, since it uses less digits than its factorization.
10120031021113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2395503.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10120031021113 its reverse (31112013002101), we get a palindrome (41232044023214).
The spelling of 10120031021113 in words is "ten trillion, one hundred twenty billion, thirty-one million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •