Base | Representation |
---|---|
bin | 1001000110101010100101… |
… | …0011101111011110110000 |
3 | 1022102221212002010011112210 |
4 | 2101222221103233132300 |
5 | 2303001203231340100 |
6 | 33142325534052120 |
7 | 2052130651601451 |
oct | 221525123573660 |
9 | 38387762104483 |
10 | 10010114324400 |
11 | 320a2a1633703 |
12 | 115803b04a040 |
13 | 577c46733468 |
14 | 2686c6531128 |
15 | 1255bcd84c50 |
hex | 91aa94ef7b0 |
10010114324400 has 60 divisors (see below), whose sum is σ = 32065732889672. Its totient is φ = 2669363819520.
The previous prime is 10010114324389. The next prime is 10010114324401. The reversal of 10010114324400 is 442341101001.
It is a tau number, because it is divible by the number of its divisors (60).
It is not an unprimeable number, because it can be changed into a prime (10010114324401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4170879769 + ... + 4170882168.
Almost surely, 210010114324400 is an apocalyptic number.
10010114324400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010114324400 is an abundant number, since it is smaller than the sum of its proper divisors (22055618565272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010114324400 is a wasteful number, since it uses less digits than its factorization.
10010114324400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8341761958 (or 8341761947 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 10010114324400 its reverse (442341101001), we get a palindrome (10452455425401).
The spelling of 10010114324400 in words is "ten trillion, ten billion, one hundred fourteen million, three hundred twenty-four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •