Base | Representation |
---|---|
bin | 1001001100101011000011… |
… | …0110101001110110110110 |
3 | 1022210211020200001102010010 |
4 | 2103022300312221312312 |
5 | 2311144034423211042 |
6 | 33301554540441050 |
7 | 2062443333516042 |
oct | 223126066516666 |
9 | 38724220042103 |
10 | 10113320132022 |
11 | 324a042619498 |
12 | 1174042549186 |
13 | 5848b3465c93 |
14 | 26d6b724d022 |
15 | 12810d76859c |
hex | 932b0da9db6 |
10113320132022 has 16 divisors (see below), whose sum is σ = 20338389659952. Its totient is φ = 3352481811360.
The previous prime is 10113320131973. The next prime is 10113320132039. The reversal of 10113320132022 is 22023102331101.
It is a super-2 number, since 2×101133201320222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10113320132022.
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, 4656223653 + ... + 4656225824.
It is an arithmetic number, because the mean of its divisors is an integer number (1271149353747).
Almost surely, 210113320132022 is an apocalyptic number.
10113320132022 is an abundant number, since it is smaller than the sum of its proper divisors (10225069527930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113320132022 is a wasteful number, since it uses less digits than its factorization.
10113320132022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9312449663.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10113320132022 its reverse (22023102331101), we get a palindrome (32136422463123).
The spelling of 10113320132022 in words is "ten trillion, one hundred thirteen billion, three hundred twenty million, one hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •