Base | Representation |
---|---|
bin | 1010100111111000000001… |
… | …0011011101111110010000 |
3 | 1112100121120000222212122120 |
4 | 2221332000103131332100 |
5 | 3012331441134234401 |
6 | 40501443450334240 |
7 | 2313602316351510 |
oct | 251760023357620 |
9 | 45317500885576 |
10 | 11680168664976 |
11 | 37a359378a029 |
12 | 1387840a2a380 |
13 | 66958711bb16 |
14 | 2c5474b3b840 |
15 | 153c64710836 |
hex | a9f804ddf90 |
11680168664976 has 80 divisors (see below), whose sum is σ = 34540563083904. Its totient is φ = 3331746957312.
The previous prime is 11680168664963. The next prime is 11680168664977. The reversal of 11680168664976 is 67946686108611.
11680168664976 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 11680168664976.
It is not an unprimeable number, because it can be changed into a prime (11680168664977) 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, 28148361 + ... + 28560296.
Almost surely, 211680168664976 is an apocalyptic number.
11680168664976 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11680168664976 is an abundant number, since it is smaller than the sum of its proper divisors (22860394418928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11680168664976 is a wasteful number, since it uses less digits than its factorization.
11680168664976 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56709288 (or 56709282 counting only the distinct ones).
The product of its (nonzero) digits is 125411328, while the sum is 69.
The spelling of 11680168664976 in words is "eleven trillion, six hundred eighty billion, one hundred sixty-eight million, six hundred sixty-four thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •