Base | Representation |
---|---|
bin | 1001001100011111110110… |
… | …0111010111010000010000 |
3 | 1022210112111002121101020010 |
4 | 2103013331213113100100 |
5 | 2311121410112031000 |
6 | 33300340315314520 |
7 | 2062305660366111 |
oct | 223077547272020 |
9 | 38715432541203 |
10 | 10110313002000 |
11 | 324883a129172 |
12 | 117354344ba40 |
13 | 5845244562c3 |
14 | 26d4adb0c208 |
15 | 127ed4766d50 |
hex | 931fd9d7410 |
10110313002000 has 80 divisors (see below), whose sum is σ = 32595649137792. Its totient is φ = 2696083465600.
The previous prime is 10110313001969. The next prime is 10110313002011. The reversal of 10110313002000 is 20031301101.
10110313002000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 842520084 + ... + 842532083.
Almost surely, 210110313002000 is an apocalyptic number.
10110313002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10110313002000 is an abundant number, since it is smaller than the sum of its proper divisors (22485336135792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110313002000 is a wasteful number, since it uses less digits than its factorization.
10110313002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1685052193 (or 1685052177 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10110313002000 its reverse (20031301101), we get a palindrome (10130344303101).
The spelling of 10110313002000 in words is "ten trillion, one hundred ten billion, three hundred thirteen million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •