Base | Representation |
---|---|
bin | 10010110100100010… |
… | …01111001000000000 |
3 | 222002012012211100010 |
4 | 21122101033020000 |
5 | 131143211334212 |
6 | 4350352224520 |
7 | 505253001135 |
oct | 113221171000 |
9 | 28065184303 |
10 | 10104402432 |
11 | 4315743113 |
12 | 1b5bb3b140 |
13 | c50512a67 |
14 | 6bbd7c58c |
15 | 3e213203c |
hex | 25a44f200 |
10104402432 has 80 divisors (see below), whose sum is σ = 26939829312. Its totient is φ = 3365498880.
The previous prime is 10104402431. The next prime is 10104402449. The reversal of 10104402432 is 23420440101.
It is a junction number, because it is equal to n+sod(n) for n = 10104402399 and 10104402408.
It is not an unprimeable number, because it can be changed into a prime (10104402431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3618957 + ... + 3621747.
Almost surely, 210104402432 is an apocalyptic number.
10104402432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10104402432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13469914656).
10104402432 is an abundant number, since it is smaller than the sum of its proper divisors (16835426880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10104402432 is an equidigital number, since it uses as much as digits as its factorization.
10104402432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5169 (or 5153 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 10104402432 its reverse (23420440101), we get a palindrome (33524842533).
The spelling of 10104402432 in words is "ten billion, one hundred four million, four hundred two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •