Base | Representation |
---|---|
bin | 1010000000101010001111… |
… | …0010101111111011001110 |
3 | 1102222012120201101010002020 |
4 | 2200022203302233323032 |
5 | 2420312204233431222 |
6 | 35224143435311010 |
7 | 2214122124042054 |
oct | 240124362577316 |
9 | 42865521333066 |
10 | 11006454202062 |
11 | 35638a1506500 |
12 | 129915b2ab466 |
13 | 61ab9a62b327 |
14 | 2a0a028181d4 |
15 | 14148311065c |
hex | a02a3cafece |
11006454202062 has 48 divisors (see below), whose sum is σ = 24210559027200. Its totient is φ = 3333283200720.
The previous prime is 11006454201983. The next prime is 11006454202087. The reversal of 11006454202062 is 26020245460011.
It is a super-2 number, since 2×110064542020622 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 23 ways as a sum of consecutive naturals, for example, 3350812 + ... + 5765487.
It is an arithmetic number, because the mean of its divisors is an integer number (504386646400).
Almost surely, 211006454202062 is an apocalyptic number.
11006454202062 is an abundant number, since it is smaller than the sum of its proper divisors (13204104825138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11006454202062 is a wasteful number, since it uses less digits than its factorization.
11006454202062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9117989 (or 9117978 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 11006454202062 its reverse (26020245460011), we get a palindrome (37026699662073).
The spelling of 11006454202062 in words is "eleven trillion, six billion, four hundred fifty-four million, two hundred two thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •