Base | Representation |
---|---|
bin | 10101010000111101… |
… | …11101011110100100 |
3 | 1002110122101112120100 |
4 | 22220132331132210 |
5 | 141340123414022 |
6 | 5124505504100 |
7 | 552625460124 |
oct | 125036753644 |
9 | 32418345510 |
10 | 11416623012 |
11 | 4929427933 |
12 | 22674a2030 |
13 | 10cc339242 |
14 | 7a4360c84 |
15 | 46c4381ac |
hex | 2a87bd7a4 |
11416623012 has 18 divisors (see below), whose sum is σ = 28858686038. Its totient is φ = 3805540992.
The previous prime is 11416622957. The next prime is 11416623017. The reversal of 11416623012 is 21032661411.
It is a happy number.
11416623012 is a `hidden beast` number, since 1 + 1 + 416 + 6 + 230 + 12 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10655194176 + 761428836 = 103224^2 + 27594^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is not an unprimeable number, because it can be changed into a prime (11416623017) 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 5 ways as a sum of consecutive naturals, for example, 158564173 + ... + 158564244.
Almost surely, 211416623012 is an apocalyptic number.
11416623012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11416623012 is an abundant number, since it is smaller than the sum of its proper divisors (17442063026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11416623012 is a wasteful number, since it uses less digits than its factorization.
11416623012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317128427 (or 317128422 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 11416623012 in words is "eleven billion, four hundred sixteen million, six hundred twenty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •