Base | Representation |
---|---|
bin | 11101001000101110111… |
… | …01111011100101010010 |
3 | 10112201001211222022112100 |
4 | 32210113131323211102 |
5 | 112400244000232122 |
6 | 2043524135341230 |
7 | 132220466651316 |
oct | 16442735734522 |
9 | 3481054868470 |
10 | 1001121102162 |
11 | 356633843605 |
12 | 142035521816 |
13 | 735366274bc |
14 | 366512b9b46 |
15 | 1b094db9aac |
hex | e91777b952 |
1001121102162 has 48 divisors (see below), whose sum is σ = 2239384313088. Its totient is φ = 322896460320.
The previous prime is 1001121102161. The next prime is 1001121102227. The reversal of 1001121102162 is 2612011211001.
It is a super-2 number, since 2×10011211021622 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1001121102161) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 3923493 + ... + 4170855.
It is an arithmetic number, because the mean of its divisors is an integer number (46653839856).
Almost surely, 21001121102162 is an apocalyptic number.
1001121102162 is an abundant number, since it is smaller than the sum of its proper divisors (1238263210926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001121102162 is a wasteful number, since it uses less digits than its factorization.
1001121102162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254655 (or 254652 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1001121102162 its reverse (2612011211001), we get a palindrome (3613132313163).
The spelling of 1001121102162 in words is "one trillion, one billion, one hundred twenty-one million, one hundred two thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •