Base | Representation |
---|---|
bin | 1001001000100110101100… |
… | …1100101000100011100000 |
3 | 1022120010212001020001201102 |
4 | 2102021223030220203200 |
5 | 2304022422043341000 |
6 | 33205520003453532 |
7 | 2054420415351062 |
oct | 222115314504340 |
9 | 38503761201642 |
10 | 10043432012000 |
11 | 32224395a2512 |
12 | 11625990872a8 |
13 | 57b1262615ca |
14 | 26a16743b732 |
15 | 1263bcda73d5 |
hex | 9226b3288e0 |
10043432012000 has 96 divisors (see below), whose sum is σ = 24678071911584. Its totient is φ = 4017151488000.
The previous prime is 10043432011969. The next prime is 10043432012027. The reversal of 10043432012000 is 21023434001.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85905584 + ... + 86022416.
It is an arithmetic number, because the mean of its divisors is an integer number (257063249079).
Almost surely, 210043432012000 is an apocalyptic number.
10043432012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10043432012000 is an abundant number, since it is smaller than the sum of its proper divisors (14634639899584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10043432012000 is a wasteful number, since it uses less digits than its factorization.
10043432012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138349 (or 138331 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10043432012000 its reverse (21023434001), we get a palindrome (10064455446001).
The spelling of 10043432012000 in words is "ten trillion, forty-three billion, four hundred thirty-two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •