Base | Representation |
---|---|
bin | 1010010010011001111000… |
… | …1000110100010101100110 |
3 | 1111001100110002021220012000 |
4 | 2210212132020310111212 |
5 | 2440311021303031042 |
6 | 40020201305510130 |
7 | 2245133415430131 |
oct | 244463610642546 |
9 | 44040402256160 |
10 | 11311302002022 |
11 | 3671107105650 |
12 | 13282581a2346 |
13 | 6408608c9409 |
14 | 2b168171d218 |
15 | 1493761ae74c |
hex | a499e234566 |
11311302002022 has 64 divisors (see below), whose sum is σ = 27559134144000. Its totient is φ = 3410442779040.
The previous prime is 11311302001973. The next prime is 11311302002047. The reversal of 11311302002022 is 22020020311311.
11311302002022 is a `hidden beast` number, since 1 + 131 + 130 + 200 + 202 + 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 = 11311302001986 and 11311302002004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47727513 + ... + 47963924.
It is an arithmetic number, because the mean of its divisors is an integer number (430611471000).
Almost surely, 211311302002022 is an apocalyptic number.
11311302002022 is an abundant number, since it is smaller than the sum of its proper divisors (16247832141978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11311302002022 is a wasteful number, since it uses less digits than its factorization.
11311302002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95691658 (or 95691652 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11311302002022 its reverse (22020020311311), we get a palindrome (33331322313333).
The spelling of 11311302002022 in words is "eleven trillion, three hundred eleven billion, three hundred two million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •