Base | Representation |
---|---|
bin | 1010001111001001001000… |
… | …0010110110100001010110 |
3 | 1110211222210201220201002000 |
4 | 2203302102002312201112 |
5 | 2433401240210133122 |
6 | 35534332552300130 |
7 | 2241110643015426 |
oct | 243622202664126 |
9 | 43758721821060 |
10 | 11255264536662 |
11 | 364a370452503 |
12 | 13194193a1646 |
13 | 6384a00a39a3 |
14 | 2aca8722a486 |
15 | 147b967810ac |
hex | a3c920b6856 |
11255264536662 has 32 divisors (see below), whose sum is σ = 25543862784000. Its totient is φ = 3671930273544.
The previous prime is 11255264536601. The next prime is 11255264536667. The reversal of 11255264536662 is 26663546255211.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 11255264536599 and 11255264536608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11255264536667) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2217346662 + ... + 2217351737.
It is an arithmetic number, because the mean of its divisors is an integer number (798245712000).
Almost surely, 211255264536662 is an apocalyptic number.
11255264536662 is an abundant number, since it is smaller than the sum of its proper divisors (14288598247338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11255264536662 is a wasteful number, since it uses less digits than its factorization.
11255264536662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4434698457 (or 4434698451 counting only the distinct ones).
The product of its digits is 15552000, while the sum is 54.
The spelling of 11255264536662 in words is "eleven trillion, two hundred fifty-five billion, two hundred sixty-four million, five hundred thirty-six thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •