Base | Representation |
---|---|
bin | 1001001100101011000101… |
… | …1101011111000010000100 |
3 | 1022210211021101012120110102 |
4 | 2103022301131133002010 |
5 | 2311144100024430200 |
6 | 33301555542543232 |
7 | 2062443516163166 |
oct | 223126135370204 |
9 | 38724241176412 |
10 | 10113330311300 |
11 | 324a048341317 |
12 | 1174045a37b18 |
13 | 5848b55bb318 |
14 | 26d6b873c936 |
15 | 12810e5c96d5 |
hex | 932b175f084 |
10113330311300 has 72 divisors (see below), whose sum is σ = 23103894693600. Its totient is φ = 3831935627520.
The previous prime is 10113330311261. The next prime is 10113330311303. The reversal of 10113330311300 is 311303331101.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (10113330311303) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14884799 + ... + 15549401.
It is an arithmetic number, because the mean of its divisors is an integer number (320887426300).
Almost surely, 210113330311300 is an apocalyptic number.
10113330311300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10113330311300 is an abundant number, since it is smaller than the sum of its proper divisors (12990564382300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113330311300 is a wasteful number, since it uses less digits than its factorization.
10113330311300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 672645 (or 672638 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 10113330311300 its reverse (311303331101), we get a palindrome (10424633642401).
The spelling of 10113330311300 in words is "ten trillion, one hundred thirteen billion, three hundred thirty million, three hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •