Base | Representation |
---|---|
bin | 1010100110011111100011… |
… | …0111000100100110110100 |
3 | 1112021100021001102220002022 |
4 | 2221213320313010212310 |
5 | 3011434322343213104 |
6 | 40442515221332312 |
7 | 2312101663425110 |
oct | 251477067044664 |
9 | 45240231386068 |
10 | 11656421460404 |
11 | 3794508039826 |
12 | 1383113b67098 |
13 | 667271303696 |
14 | 2c4260d08740 |
15 | 153324a06bbe |
hex | a99f8dc49b4 |
11656421460404 has 24 divisors (see below), whose sum is σ = 24684186623040. Its totient is φ = 4701749832576.
The previous prime is 11656421460389. The next prime is 11656421460451. The reversal of 11656421460404 is 40406412465611.
It is a super-2 number, since 2×116564214604042 (a number of 27 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 12244139714 + ... + 12244140665.
It is an arithmetic number, because the mean of its divisors is an integer number (1028507775960).
Almost surely, 211656421460404 is an apocalyptic number.
11656421460404 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11656421460404 is an abundant number, since it is smaller than the sum of its proper divisors (13027765162636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11656421460404 is a wasteful number, since it uses less digits than its factorization.
11656421460404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24488280407 (or 24488280405 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 44.
The spelling of 11656421460404 in words is "eleven trillion, six hundred fifty-six billion, four hundred twenty-one million, four hundred sixty thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •