Base | Representation |
---|---|
bin | 1001001100101010010011… |
… | …1011100110111111101111 |
3 | 1022210210201201122221211211 |
4 | 2103022210323212333233 |
5 | 2311143132221320211 |
6 | 33301523033255251 |
7 | 2062435354355161 |
oct | 223124473467757 |
9 | 38723651587754 |
10 | 10113120104431 |
11 | 3249a4a717833 |
12 | 1173ba7564527 |
13 | 584880b9c266 |
14 | 26d698860931 |
15 | 1280eae05e21 |
hex | 932a4ee6fef |
10113120104431 has 4 divisors (see below), whose sum is σ = 10278908958664. Its totient is φ = 9947331250200.
The previous prime is 10113120104429. The next prime is 10113120104443. The reversal of 10113120104431 is 13440102131101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10113120104431 - 21 = 10113120104429 is a prime.
It is a super-2 number, since 2×101131201044312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113120104491) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82894427025 + ... + 82894427146.
It is an arithmetic number, because the mean of its divisors is an integer number (2569727239666).
Almost surely, 210113120104431 is an apocalyptic number.
10113120104431 is a deficient number, since it is larger than the sum of its proper divisors (165788854233).
10113120104431 is an equidigital number, since it uses as much as digits as its factorization.
10113120104431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165788854232.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 10113120104431 its reverse (13440102131101), we get a palindrome (23553222235532).
The spelling of 10113120104431 in words is "ten trillion, one hundred thirteen billion, one hundred twenty million, one hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •