Base | Representation |
---|---|
bin | 10010110000000101… |
… | …100000010100011110 |
3 | 1220222011212101000200 |
4 | 102300011200110132 |
5 | 312213312233202 |
6 | 13125515404330 |
7 | 1311641021466 |
oct | 226005402436 |
9 | 56864771020 |
10 | 20134102302 |
11 | 85a21a3076 |
12 | 3a9aa536a6 |
13 | 1b8b3cb702 |
14 | d90032ba6 |
15 | 7cc909e1c |
hex | 4b016051e |
20134102302 has 12 divisors (see below), whose sum is σ = 43623888360. Its totient is φ = 6711367428.
The previous prime is 20134102283. The next prime is 20134102327. The reversal of 20134102302 is 20320143102.
20134102302 is a `hidden beast` number, since 20 + 1 + 3 + 410 + 230 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1118561239 = 20134102302 / (2 + 0 + 1 + 3 + 4 + 1 + 0 + 2 + 3 + 0 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 559280602 + ... + 559280637.
It is an arithmetic number, because the mean of its divisors is an integer number (3635324030).
Almost surely, 220134102302 is an apocalyptic number.
20134102302 is an abundant number, since it is smaller than the sum of its proper divisors (23489786058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20134102302 is a wasteful number, since it uses less digits than its factorization.
20134102302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1118561247 (or 1118561244 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20134102302 its reverse (20320143102), we get a palindrome (40454245404).
The spelling of 20134102302 in words is "twenty billion, one hundred thirty-four million, one hundred two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •