Base | Representation |
---|---|
bin | 10000110100110011010… |
… | …100111011101110100100 |
3 | 11002112101002001212210201 |
4 | 100310303110323232210 |
5 | 122420403034000124 |
6 | 2243053155400244 |
7 | 146350616063650 |
oct | 20646324735644 |
9 | 4075332055721 |
10 | 1156207328164 |
11 | 406387992619 |
12 | 1680b75b3084 |
13 | 85050865735 |
14 | 3dd64375a60 |
15 | 20120284144 |
hex | 10d3353bba4 |
1156207328164 has 12 divisors (see below), whose sum is σ = 2312414656384. Its totient is φ = 495517426344.
The previous prime is 1156207328161. The next prime is 1156207328167. The reversal of 1156207328164 is 4618237026511.
It is an interprime number because it is at equal distance from previous prime (1156207328161) and next prime (1156207328167).
1156207328164 is an admirable number.
It is a super-2 number, since 2×11562073281642 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1156207328161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20646559404 + ... + 20646559459.
Almost surely, 21156207328164 is an apocalyptic number.
1156207328164 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1156207328164 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156207328164 is a wasteful number, since it uses less digits than its factorization.
1156207328164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41293118874 (or 41293118872 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 46.
The spelling of 1156207328164 in words is "one trillion, one hundred fifty-six billion, two hundred seven million, three hundred twenty-eight thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •