Base | Representation |
---|---|
bin | 10011000000000000… |
… | …010000010110100001 |
3 | 1221122210101101120000 |
4 | 103000000100112201 |
5 | 313240144133013 |
6 | 13212215410213 |
7 | 1321363004226 |
oct | 230000202641 |
9 | 57583341500 |
10 | 20401161633 |
11 | 8719a18766 |
12 | 3b54383969 |
13 | 1c01834b98 |
14 | db76ad94d |
15 | 7e60ad973 |
hex | 4c00105a1 |
20401161633 has 20 divisors (see below), whose sum is σ = 30695076720. Its totient is φ = 13502919672.
The previous prime is 20401161629. The next prime is 20401161637. The reversal of 20401161633 is 33616110402.
20401161633 is a `hidden beast` number, since 2 + 0 + 4 + 0 + 11 + 616 + 33 = 666.
It is an interprime number because it is at equal distance from previous prime (20401161629) and next prime (20401161637).
It is not a de Polignac number, because 20401161633 - 22 = 20401161629 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20401161597 and 20401161606.
It is not an unprimeable number, because it can be changed into a prime (20401161637) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 894735 + ... + 917252.
It is an arithmetic number, because the mean of its divisors is an integer number (1534753836).
Almost surely, 220401161633 is an apocalyptic number.
It is an amenable number.
20401161633 is a deficient number, since it is larger than the sum of its proper divisors (10293915087).
20401161633 is a wasteful number, since it uses less digits than its factorization.
20401161633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1812138 (or 1812129 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 20401161633 in words is "twenty billion, four hundred one million, one hundred sixty-one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •