Base | Representation |
---|---|
bin | 1001011101100110011010… |
… | …1010110110111011111100 |
3 | 1100211121212221100010020220 |
4 | 2113121212222312323330 |
5 | 2330430131111131022 |
6 | 34043332020141340 |
7 | 2122450056624432 |
oct | 227314652667374 |
9 | 40747787303226 |
10 | 10404133302012 |
11 | 335140601739a |
12 | 1200483237850 |
13 | 5a614abbb9a8 |
14 | 27d7c4224d52 |
15 | 13097e64385c |
hex | 97666ab6efc |
10404133302012 has 96 divisors (see below), whose sum is σ = 24775119129600. Its totient is φ = 3397612108800.
The previous prime is 10404133301993. The next prime is 10404133302119. The reversal of 10404133302012 is 21020333140401.
It is a happy number.
It is a super-4 number, since 4×104041333020124 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 81973233 + ... + 82100055.
It is an arithmetic number, because the mean of its divisors is an integer number (258074157600).
Almost surely, 210404133302012 is an apocalyptic number.
10404133302012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10404133302012 is an abundant number, since it is smaller than the sum of its proper divisors (14370985827588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10404133302012 is a wasteful number, since it uses less digits than its factorization.
10404133302012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127643 (or 127641 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10404133302012 its reverse (21020333140401), we get a palindrome (31424466442413).
The spelling of 10404133302012 in words is "ten trillion, four hundred four billion, one hundred thirty-three million, three hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •