Base | Representation |
---|---|
bin | 10101010100100101… |
… | …11001000100111010 |
3 | 1002112202120112202000 |
4 | 22222102321010322 |
5 | 141420413414230 |
6 | 5131513121430 |
7 | 553445003520 |
oct | 125222710472 |
9 | 32482515660 |
10 | 11447013690 |
11 | 49445a48a2 |
12 | 22756b9276 |
13 | 1105719ca8 |
14 | 7a83d2310 |
15 | 46ee3cb60 |
hex | 2aa4b913a |
11447013690 has 192 divisors, whose sum is σ = 36168249600. Its totient is φ = 2520709632.
The previous prime is 11447013673. The next prime is 11447013709. The reversal of 11447013690 is 9631074411.
11447013690 is a `hidden beast` number, since 114 + 470 + 13 + 69 + 0 = 666.
It is a super-2 number, since 2×114470136902 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 25047942 + ... + 25048398.
It is an arithmetic number, because the mean of its divisors is an integer number (188376300).
Almost surely, 211447013690 is an apocalyptic number.
11447013690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11447013690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18084124800).
11447013690 is an abundant number, since it is smaller than the sum of its proper divisors (24721235910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11447013690 is an equidigital number, since it uses as much as digits as its factorization.
11447013690 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 966 (or 503 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The spelling of 11447013690 in words is "eleven billion, four hundred forty-seven million, thirteen thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •