Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1011111111000011000010 |
3 | 1022210121112201102112211200 |
4 | 2103020231023333003002 |
5 | 2311130023422200310 |
6 | 33300551430122030 |
7 | 2062334521361556 |
oct | 223105513770302 |
9 | 38717481375750 |
10 | 10111111131330 |
11 | 3249109701590 |
12 | 11737267b0316 |
13 | 584620902891 |
14 | 26d547b0b866 |
15 | 12802e86e9c0 |
hex | 9322d2ff0c2 |
10111111131330 has 48 divisors (see below), whose sum is σ = 28678787938944. Its totient is φ = 2451178455840.
The previous prime is 10111111131313. The next prime is 10111111131463. The reversal of 10111111131330 is 3313111111101.
10111111131330 is a `hidden beast` number, since 101 + 111 + 111 + 313 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5106620794 + ... + 5106622773.
It is an arithmetic number, because the mean of its divisors is an integer number (597474748728).
Almost surely, 210111111131330 is an apocalyptic number.
10111111131330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111111131330 is an abundant number, since it is smaller than the sum of its proper divisors (18567676807614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111111131330 is a wasteful number, since it uses less digits than its factorization.
10111111131330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10213243591 (or 10213243588 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
Adding to 10111111131330 its reverse (3313111111101), we get a palindrome (13424222242431).
The spelling of 10111111131330 in words is "ten trillion, one hundred eleven billion, one hundred eleven million, one hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •