Base | Representation |
---|---|
bin | 1001010100000011011000… |
… | …1111101001001001000101 |
3 | 1100020221112000111221121110 |
4 | 2111000312033221021011 |
5 | 2320233222144312010 |
6 | 33440124220435233 |
7 | 2104552344506040 |
oct | 225006617511105 |
9 | 40227460457543 |
10 | 10240112104005 |
11 | 32988973616a3 |
12 | 11947289a8b19 |
13 | 59383b81ab84 |
14 | 2758a463dc57 |
15 | 12b57eb45120 |
hex | 950363e9245 |
10240112104005 has 64 divisors (see below), whose sum is σ = 19190948313600. Its totient is φ = 4564763873280.
The previous prime is 10240112103953. The next prime is 10240112104069. The reversal of 10240112104005 is 50040121104201.
It is not a de Polignac number, because 10240112104005 - 27 = 10240112103877 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8148681 + ... + 9321009.
It is an arithmetic number, because the mean of its divisors is an integer number (299858567400).
Almost surely, 210240112104005 is an apocalyptic number.
10240112104005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10240112104005 is a deficient number, since it is larger than the sum of its proper divisors (8950836209595).
10240112104005 is a wasteful number, since it uses less digits than its factorization.
10240112104005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174414.
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 10240112104005 its reverse (50040121104201), we get a palindrome (60280233208206).
The spelling of 10240112104005 in words is "ten trillion, two hundred forty billion, one hundred twelve million, one hundred four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •