Base | Representation |
---|---|
bin | 10111110101000011101000… |
… | …010110011011010010110000 |
3 | 111202001212221212101201002200 |
4 | 113311003220112123102300 |
5 | 102214030123123343342 |
6 | 1010520543310343200 |
7 | 31034425650501603 |
oct | 2765035026332260 |
9 | 452055855351080 |
10 | 104801100215472 |
11 | 30435995a04721 |
12 | b9071a44bab00 |
13 | 4662916b15acb |
14 | 1bc458667033a |
15 | c1b1b544694c |
hex | 5f50e859b4b0 |
104801100215472 has 60 divisors (see below), whose sum is σ = 302758733968704. Its totient is φ = 33806806519680.
The previous prime is 104801100215423. The next prime is 104801100215509. The reversal of 104801100215472 is 274512001108401.
104801100215472 is a `hidden beast` number, since 1 + 0 + 4 + 8 + 0 + 1 + 100 + 2 + 1 + 547 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11738470023 + ... + 11738478950.
Almost surely, 2104801100215472 is an apocalyptic number.
104801100215472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104801100215472 is an abundant number, since it is smaller than the sum of its proper divisors (197957633753232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104801100215472 is a wasteful number, since it uses less digits than its factorization.
104801100215472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23476949018 (or 23476949009 counting only the distinct ones).
The product of its (nonzero) digits is 17920, while the sum is 36.
The spelling of 104801100215472 in words is "one hundred four trillion, eight hundred one billion, one hundred million, two hundred fifteen thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •