Base | Representation |
---|---|
bin | 1001001110010000000011… |
… | …0110010110000100000000 |
3 | 1022220102020010212122001202 |
4 | 2103210000312112010000 |
5 | 2312120101100011000 |
6 | 33322241122520332 |
7 | 2064423234046154 |
oct | 223440066260400 |
9 | 38812203778052 |
10 | 10140432032000 |
11 | 325a5955811a6 |
12 | 117934a2060a8 |
13 | 58731439594a |
14 | 270b29c9d064 |
15 | 128b98a53dd5 |
hex | 93900d96100 |
10140432032000 has 72 divisors (see below), whose sum is σ = 25261083825432. Its totient is φ = 4056172800000.
The previous prime is 10140432031913. The next prime is 10140432032021. The reversal of 10140432032000 is 23023404101.
It can be written as a sum of positive squares in 4 ways, for example, as 268871286784 + 9871560745216 = 518528^2 + 3141904^2 .
It is a super-2 number, since 2×101404320320002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 158412251 + ... + 158476250.
Almost surely, 210140432032000 is an apocalyptic number.
10140432032000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10140432032000 is an abundant number, since it is smaller than the sum of its proper divisors (15120651793432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10140432032000 is an frugal number, since it uses more digits than its factorization.
10140432032000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316888532 (or 316888508 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10140432032000 its reverse (23023404101), we get a palindrome (10163455436101).
The spelling of 10140432032000 in words is "ten trillion, one hundred forty billion, four hundred thirty-two million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •