Base | Representation |
---|---|
bin | 11101001000101100101… |
… | …01001001011010100110 |
3 | 10112201000112001221220011 |
4 | 32210112111021122212 |
5 | 112400224104203220 |
6 | 2043522214400434 |
7 | 132220145534035 |
oct | 16442625113246 |
9 | 3481015057804 |
10 | 1001102022310 |
11 | 356623aa1635 |
12 | 14202b06011a |
13 | 735326a6b50 |
14 | 3664c95071c |
15 | 1b09339b65a |
hex | e9165496a6 |
1001102022310 has 64 divisors (see below), whose sum is σ = 2008110787200. Its totient is φ = 356785615872.
The previous prime is 1001102022289. The next prime is 1001102022341. The reversal of 1001102022310 is 132202011001.
It is a super-2 number, since 2×10011020223102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13259146 + ... + 13334434.
It is an arithmetic number, because the mean of its divisors is an integer number (31376731050).
Almost surely, 21001102022310 is an apocalyptic number.
1001102022310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1001102022310 is an abundant number, since it is smaller than the sum of its proper divisors (1007008764890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001102022310 is a wasteful number, since it uses less digits than its factorization.
1001102022310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78865.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1001102022310 its reverse (132202011001), we get a palindrome (1133304033311).
The spelling of 1001102022310 in words is "one trillion, one billion, one hundred two million, twenty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •