Base | Representation |
---|---|
bin | 1010000000110111100001… |
… | …1001000000001101001100 |
3 | 1102222112210021221020001000 |
4 | 2200031320121000031030 |
5 | 2420342010334000022 |
6 | 35225533412220300 |
7 | 2214306404240646 |
oct | 240157031001514 |
9 | 42875707836030 |
10 | 11010021000012 |
11 | 3565361907601 |
12 | 129999590a690 |
13 | 61b318584b68 |
14 | 2a0c60403896 |
15 | 1415e13146ac |
hex | a037864034c |
11010021000012 has 96 divisors (see below), whose sum is σ = 28584066560000. Its totient is φ = 3664922671872.
The previous prime is 11010021000007. The next prime is 11010021000019. The reversal of 11010021000012 is 21000012001011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11010020999958 and 11010021000003.
It is not an unprimeable number, because it can be changed into a prime (11010021000019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 296276289 + ... + 296313447.
Almost surely, 211010021000012 is an apocalyptic number.
11010021000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11010021000012 is an abundant number, since it is smaller than the sum of its proper divisors (17574045559988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010021000012 is a wasteful number, since it uses less digits than its factorization.
11010021000012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40900 (or 40892 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11010021000012 its reverse (21000012001011), we get a palindrome (32010033001023).
The spelling of 11010021000012 in words is "eleven trillion, ten billion, twenty-one million, twelve", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •