Base | Representation |
---|---|
bin | 1001001100100011111010… |
… | …1101100011011111011111 |
3 | 1022210122022012122221102222 |
4 | 2103020332231203133133 |
5 | 2311131124204102111 |
6 | 33301040531535555 |
7 | 2062345021423502 |
oct | 223107655433737 |
9 | 38718265587388 |
10 | 10111405144031 |
11 | 324924a666694 |
12 | 11737a915a5bb |
13 | 5846697b53a9 |
14 | 26d574ba3139 |
15 | 12804a5997db |
hex | 9323eb637df |
10111405144031 has 4 divisors (see below), whose sum is σ = 10117019474064. Its totient is φ = 10105790814000.
The previous prime is 10111405144021. The next prime is 10111405144037. The reversal of 10111405144031 is 13044150411101.
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 10111405144031 - 218 = 10111404881887 is a prime.
It is a super-2 number, since 2×101114051440312 (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 (10111405144037) 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, 2807162315 + ... + 2807165916.
It is an arithmetic number, because the mean of its divisors is an integer number (2529254868516).
Almost surely, 210111405144031 is an apocalyptic number.
10111405144031 is a deficient number, since it is larger than the sum of its proper divisors (5614330033).
10111405144031 is an equidigital number, since it uses as much as digits as its factorization.
10111405144031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5614330032.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 10111405144031 its reverse (13044150411101), we get a palindrome (23155555555132).
The spelling of 10111405144031 in words is "ten trillion, one hundred eleven billion, four hundred five million, one hundred forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •