Base | Representation |
---|---|
bin | 1001000110101010101001… |
… | …0100111011101111110000 |
3 | 1022102221220021021102001221 |
4 | 2101222222110323233300 |
5 | 2303001222120222000 |
6 | 33142331344234424 |
7 | 2052131250056404 |
oct | 221525224735760 |
9 | 38387807242057 |
10 | 10010131414000 |
11 | 320a300246343 |
12 | 115804490ba14 |
13 | 577c4a137c53 |
14 | 2686c88dd104 |
15 | 1255be60d61a |
hex | 91aaa53bbf0 |
10010131414000 has 40 divisors (see below), whose sum is σ = 24204497763888. Its totient is φ = 4004052564800.
The previous prime is 10010131413929. The next prime is 10010131414021. The reversal of 10010131414000 is 41413101001.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2502530854 + ... + 2502534853.
Almost surely, 210010131414000 is an apocalyptic number.
10010131414000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010131414000 is an abundant number, since it is smaller than the sum of its proper divisors (14194366349888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010131414000 is an equidigital number, since it uses as much as digits as its factorization.
10010131414000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5005065730 (or 5005065714 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10010131414000 its reverse (41413101001), we get a palindrome (10051544515001).
The spelling of 10010131414000 in words is "ten trillion, ten billion, one hundred thirty-one million, four hundred fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •