Base | Representation |
---|---|
bin | 110000100111011100… |
… | …0000011101100100000 |
3 | 100222110222210012101010 |
4 | 1201032320003230200 |
5 | 3202304022030102 |
6 | 115543432340520 |
7 | 10354122614061 |
oct | 1411670035440 |
9 | 328428705333 |
10 | 104402533152 |
11 | 40305565455 |
12 | 18298244740 |
13 | 9aca94b748 |
14 | 50a5a38568 |
15 | 2ab09c3d6c |
hex | 184ee03b20 |
104402533152 has 24 divisors (see below), whose sum is σ = 274056649776. Its totient is φ = 34800844352.
The previous prime is 104402533139. The next prime is 104402533189. The reversal of 104402533152 is 251335204401.
104402533152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (24).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 543763098 + ... + 543763289.
It is an arithmetic number, because the mean of its divisors is an integer number (11419027074).
Almost surely, 2104402533152 is an apocalyptic number.
104402533152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104402533152 is an abundant number, since it is smaller than the sum of its proper divisors (169654116624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104402533152 is a wasteful number, since it uses less digits than its factorization.
104402533152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087526400 (or 1087526392 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 104402533152 its reverse (251335204401), we get a palindrome (355737737553).
The spelling of 104402533152 in words is "one hundred four billion, four hundred two million, five hundred thirty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •