Base | Representation |
---|---|
bin | 1010100000110011000101… |
… | …10001100111111101111000 |
3 | 10000211222110101221120202120 |
4 | 11100121202301213331320 |
5 | 11012222431304204000 |
6 | 121055514250201240 |
7 | 4604106023520135 |
oct | 520314261477570 |
9 | 100758411846676 |
10 | 23117171163000 |
11 | 7402a34504812 |
12 | 2714319a23220 |
13 | cb8c2ac15245 |
14 | 59cc3c8cb58c |
15 | 2a14e604b6a0 |
hex | 150662c67f78 |
23117171163000 has 128 divisors (see below), whose sum is σ = 73884734763840. Its totient is φ = 6014223360000.
The previous prime is 23117171162999. The next prime is 23117171163001. The reversal of 23117171163000 is 36117171132.
It is an interprime number because it is at equal distance from previous prime (23117171162999) and next prime (23117171163001).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23117171163001) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 93849241 + ... + 94095240.
Almost surely, 223117171163000 is an apocalyptic number.
23117171163000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23117171163000 is an abundant number, since it is smaller than the sum of its proper divisors (50767563600840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23117171163000 is a wasteful number, since it uses less digits than its factorization.
23117171163000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187944546 (or 187944532 counting only the distinct ones).
The product of its (nonzero) digits is 5292, while the sum is 33.
The spelling of 23117171163000 in words is "twenty-three trillion, one hundred seventeen billion, one hundred seventy-one million, one hundred sixty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •