Base | Representation |
---|---|
bin | 1001011101100110010101… |
… | …0010110110011011000000 |
3 | 1100211121211022221000002120 |
4 | 2113121211102312123000 |
5 | 2330430104204344412 |
6 | 34043325433444240 |
7 | 2122446356545614 |
oct | 227314522663300 |
9 | 40747738830076 |
10 | 10404110231232 |
11 | 33513a3a99a33 |
12 | 1200477570680 |
13 | 5a61461a1943 |
14 | 27d7c113b344 |
15 | 13097c5d7b8c |
hex | 976654b66c0 |
10404110231232 has 112 divisors (see below), whose sum is σ = 28691407460352. Its totient is φ = 3323580272640.
The previous prime is 10404110231189. The next prime is 10404110231233. The reversal of 10404110231232 is 23213201140401.
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 (10404110231233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7872393 + ... + 9098504.
It is an arithmetic number, because the mean of its divisors is an integer number (256173280896).
Almost surely, 210404110231232 is an apocalyptic number.
10404110231232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10404110231232 is an abundant number, since it is smaller than the sum of its proper divisors (18287297229120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10404110231232 is a wasteful number, since it uses less digits than its factorization.
10404110231232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16971046 (or 16971036 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 10404110231232 its reverse (23213201140401), we get a palindrome (33617311371633).
The spelling of 10404110231232 in words is "ten trillion, four hundred four billion, one hundred ten million, two hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •