Base | Representation |
---|---|
bin | 1001000111010011001011… |
… | …0111111100111101110000 |
3 | 1022110222222120110010121010 |
4 | 2101310302313330331300 |
5 | 2303141013112330000 |
6 | 33151331154030520 |
7 | 2052665011350132 |
oct | 221646267747560 |
9 | 38428876403533 |
10 | 10021012230000 |
11 | 321398417a462 |
12 | 115a180878440 |
13 | 578c92462c05 |
14 | 26903ba27052 |
15 | 125a099a8d50 |
hex | 91d32dfcf70 |
10021012230000 has 100 divisors (see below), whose sum is σ = 32349163710248. Its totient is φ = 2672269920000.
The previous prime is 10021012229957. The next prime is 10021012230017. The reversal of 10021012230000 is 3221012001.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×100210122300002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 166986871 + ... + 167046870.
Almost surely, 210021012230000 is an apocalyptic number.
10021012230000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10021012230000 is an abundant number, since it is smaller than the sum of its proper divisors (22328151480248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021012230000 is an equidigital number, since it uses as much as digits as its factorization.
10021012230000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334033772 (or 334033751 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10021012230000 its reverse (3221012001), we get a palindrome (10024233242001).
The spelling of 10021012230000 in words is "ten trillion, twenty-one billion, twelve million, two hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •