Base | Representation |
---|---|
bin | 1010011010100100110001… |
… | …0000001101111110110010 |
3 | 1111112202202000122020012000 |
4 | 2212221030100031332302 |
5 | 3000111001001143442 |
6 | 40204453154314430 |
7 | 2261232602021403 |
oct | 246511420157662 |
9 | 44482660566160 |
10 | 11451662131122 |
11 | 3715693802044 |
12 | 134b4aa588a16 |
13 | 650b6bc7cb45 |
14 | 2b8398ad39aa |
15 | 14cd3d81ad4c |
hex | a6a4c40dfb2 |
11451662131122 has 32 divisors (see below), whose sum is σ = 25531031064000. Its totient is φ = 3804786761184.
The previous prime is 11451662131061. The next prime is 11451662131123. The reversal of 11451662131122 is 22113126615411.
11451662131122 is a `hidden beast` number, since 1 + 1 + 4 + 5 + 1 + 6 + 621 + 3 + 1 + 1 + 22 = 666.
It is a super-2 number, since 2×114516621311222 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11451662131123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 345370747 + ... + 345403902.
It is an arithmetic number, because the mean of its divisors is an integer number (797844720750).
Almost surely, 211451662131122 is an apocalyptic number.
11451662131122 is an abundant number, since it is smaller than the sum of its proper divisors (14079368932878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11451662131122 is a wasteful number, since it uses less digits than its factorization.
11451662131122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690774967 (or 690774961 counting only the distinct ones).
The product of its digits is 17280, while the sum is 36.
Adding to 11451662131122 its reverse (22113126615411), we get a palindrome (33564788746533).
The spelling of 11451662131122 in words is "eleven trillion, four hundred fifty-one billion, six hundred sixty-two million, one hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •