Base | Representation |
---|---|
bin | 10011001111101100… |
… | …10000010100000000 |
3 | 222200001212200011110 |
4 | 21213312100110000 |
5 | 132130021213212 |
6 | 4425131043320 |
7 | 514020224325 |
oct | 114766202400 |
9 | 28601780143 |
10 | 10332210432 |
11 | 4422299695 |
12 | 20042a0540 |
13 | c887853ab |
14 | 70031cb4c |
15 | 407130a3c |
hex | 267d90500 |
10332210432 has 72 divisors (see below), whose sum is σ = 27909315616. Its totient is φ = 3392649216.
The previous prime is 10332210419. The next prime is 10332210437. The reversal of 10332210432 is 23401223301.
It is a super-2 number, since 2×103322104322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10332210399 and 10332210408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10332210437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48943 + ... + 151854.
Almost surely, 210332210432 is an apocalyptic number.
10332210432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10332210432 is an abundant number, since it is smaller than the sum of its proper divisors (17577105184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10332210432 is an equidigital number, since it uses as much as digits as its factorization.
10332210432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200883 (or 200869 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 10332210432 its reverse (23401223301), we get a palindrome (33733433733).
The spelling of 10332210432 in words is "ten billion, three hundred thirty-two million, two hundred ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •