Base | Representation |
---|---|
bin | 1001000110101110010001… |
… | …0011011100010010000000 |
3 | 1022110001102001120001111001 |
4 | 2101223210103130102000 |
5 | 2303010220122222004 |
6 | 33143012052301344 |
7 | 2052164330554132 |
oct | 221534423342200 |
9 | 38401361501431 |
10 | 10011104101504 |
11 | 320a75a304910 |
12 | 1158276611854 |
13 | 57807380149c |
14 | 26877bb7b052 |
15 | 125629be71a4 |
hex | 91ae44dc480 |
10011104101504 has 64 divisors (see below), whose sum is σ = 22458928654080. Its totient is φ = 4403711462400.
The previous prime is 10011104101499. The next prime is 10011104101567. The reversal of 10011104101504 is 40510140111001.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×100111041015042 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 114636339 + ... + 114723634.
It is an arithmetic number, because the mean of its divisors is an integer number (350920760220).
Almost surely, 210011104101504 is an apocalyptic number.
It is an amenable number.
10011104101504 is an abundant number, since it is smaller than the sum of its proper divisors (12447824552576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011104101504 is a wasteful number, since it uses less digits than its factorization.
10011104101504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229360029 (or 229360017 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 10011104101504 its reverse (40510140111001), we get a palindrome (50521244212505).
The spelling of 10011104101504 in words is "ten trillion, eleven billion, one hundred four million, one hundred one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.201 sec. • engine limits •