Base | Representation |
---|---|
bin | 11101010000111010110… |
… | …011000011000111100000 |
3 | 21010020211012220121001121 |
4 | 131100322303003013200 |
5 | 230422042433431133 |
6 | 4135504400542024 |
7 | 265202140530220 |
oct | 35207263030740 |
9 | 7106735817047 |
10 | 2011031155168 |
11 | 705967728a52 |
12 | 285902321914 |
13 | 117840a79719 |
14 | 6d497950080 |
15 | 374a167302d |
hex | 1d43acc31e0 |
2011031155168 has 72 divisors (see below), whose sum is σ = 4806642958992. Its totient is φ = 811172204544.
The previous prime is 2011031155123. The next prime is 2011031155169. The reversal of 2011031155168 is 8615511301102.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011031155169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15467821 + ... + 15597292.
It is an arithmetic number, because the mean of its divisors is an integer number (66758929986).
Almost surely, 22011031155168 is an apocalyptic number.
2011031155168 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
2011031155168 is an abundant number, since it is smaller than the sum of its proper divisors (2795611803824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011031155168 is a wasteful number, since it uses less digits than its factorization.
2011031155168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31065164 (or 31065139 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 34.
The spelling of 2011031155168 in words is "two trillion, eleven billion, thirty-one million, one hundred fifty-five thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •