Base | Representation |
---|---|
bin | 10010111100011001… |
… | …010010011011101100 |
3 | 1221111120110022001010 |
4 | 102330121102123230 |
5 | 313124144134032 |
6 | 13202213545220 |
7 | 1320026242143 |
oct | 227431223354 |
9 | 57446408033 |
10 | 20340614892 |
11 | 8698824034 |
12 | 3b38045210 |
13 | 1bc2126100 |
14 | dad62c75a |
15 | 7e0aedccc |
hex | 4bc6526ec |
20340614892 has 54 divisors (see below), whose sum is σ = 51409384068. Its totient is φ = 6256674528.
The previous prime is 20340614849. The next prime is 20340614893. The reversal of 20340614892 is 29841604302.
It is a super-2 number, since 2×203406148922 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 20340614892.
It is not an unprimeable number, because it can be changed into a prime (20340614893) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 6421093 + ... + 6424259.
Almost surely, 220340614892 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20340614892, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25704692034).
20340614892 is an abundant number, since it is smaller than the sum of its proper divisors (31068769176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20340614892 is an equidigital number, since it uses as much as digits as its factorization.
20340614892 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6367 (or 3185 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 39.
The spelling of 20340614892 in words is "twenty billion, three hundred forty million, six hundred fourteen thousand, eight hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •