Base | Representation |
---|---|
bin | 1001001000011011011010… |
… | …1011000101110110101000 |
3 | 1022112212000222012120200020 |
4 | 2102012312223011312220 |
5 | 2304000221222221412 |
6 | 33204255252240440 |
7 | 2054252361035655 |
oct | 222066653056650 |
9 | 38485028176606 |
10 | 10040403320232 |
11 | 3221124a1556a |
12 | 1161a92910120 |
13 | 57aa629426bc |
14 | 269d5b0c6c2c |
15 | 12629204718c |
hex | 921b6ac5da8 |
10040403320232 has 32 divisors (see below), whose sum is σ = 25910718247680. Its totient is φ = 3238839780480.
The previous prime is 10040403320231. The next prime is 10040403320291. The reversal of 10040403320232 is 23202330404001.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10040403320231) 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, 6747582133 + ... + 6747583620.
It is an arithmetic number, because the mean of its divisors is an integer number (809709945240).
Almost surely, 210040403320232 is an apocalyptic number.
10040403320232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10040403320232 is an abundant number, since it is smaller than the sum of its proper divisors (15870314927448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10040403320232 is a wasteful number, since it uses less digits than its factorization.
10040403320232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13495165793 (or 13495165789 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 10040403320232 its reverse (23202330404001), we get a palindrome (33242733724233).
The spelling of 10040403320232 in words is "ten trillion, forty billion, four hundred three million, three hundred twenty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •