Base | Representation |
---|---|
bin | 1001000110110101101111… |
… | …1100010011101101101110 |
3 | 1022110020120221110110100000 |
4 | 2101231123330103231232 |
5 | 2303023322443144042 |
6 | 33143543153445130 |
7 | 2052265142521452 |
oct | 221553374235556 |
9 | 38406527413300 |
10 | 10013111303022 |
11 | 321059a320043 |
12 | 11587368707a6 |
13 | 5783035ca6a9 |
14 | 2688cc58c662 |
15 | 1256e602d74c |
hex | 91b5bf13b6e |
10013111303022 has 48 divisors (see below), whose sum is σ = 22499259440112. Its totient is φ = 3337605311040.
The previous prime is 10013111302993. The next prime is 10013111303087. The reversal of 10013111303022 is 22030311131001.
10013111303022 is a `hidden beast` number, since 100 + 131 + 1 + 130 + 302 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10013111302986 and 10013111303004.
It is a congruent number.
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, 17228122 + ... + 17799842.
It is an arithmetic number, because the mean of its divisors is an integer number (468734571669).
Almost surely, 210013111303022 is an apocalyptic number.
10013111303022 is an abundant number, since it is smaller than the sum of its proper divisors (12486148137090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10013111303022 is an equidigital number, since it uses as much as digits as its factorization.
10013111303022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 607775 (or 607763 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10013111303022 its reverse (22030311131001), we get a palindrome (32043422434023).
The spelling of 10013111303022 in words is "ten trillion, thirteen billion, one hundred eleven million, three hundred three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •