Base | Representation |
---|---|
bin | 1010100110100000100101… |
… | …1111101100100110100011 |
3 | 1112021100222111120212210020 |
4 | 2221220021133230212203 |
5 | 3011440410314423233 |
6 | 40443003031204523 |
7 | 2312111622545112 |
oct | 251501137544643 |
9 | 45240874525706 |
10 | 11656700545443 |
11 | 3794640628518 |
12 | 1383191516743 |
13 | 6672b708a765 |
14 | 2c4289dd5c79 |
15 | 15333e2839b3 |
hex | a9a097ec9a3 |
11656700545443 has 16 divisors (see below), whose sum is σ = 16472028878496. Its totient is φ = 7307114647040.
The previous prime is 11656700545421. The next prime is 11656700545463. The reversal of 11656700545443 is 34454500765611.
11656700545443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11656700545443 - 25 = 11656700545411 is a prime.
It is a super-2 number, since 2×116567005454432 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (11656700545463) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107656896 + ... + 107765117.
It is an arithmetic number, because the mean of its divisors is an integer number (1029501804906).
Almost surely, 211656700545443 is an apocalyptic number.
11656700545443 is a deficient number, since it is larger than the sum of its proper divisors (4815328333053).
11656700545443 is a wasteful number, since it uses less digits than its factorization.
11656700545443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 215423094.
The product of its (nonzero) digits is 6048000, while the sum is 51.
The spelling of 11656700545443 in words is "eleven trillion, six hundred fifty-six billion, seven hundred million, five hundred forty-five thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •