Base | Representation |
---|---|
bin | 1001001001111111011101… |
… | …00000100000001101100110 |
3 | 2122021211200211210210102010 |
4 | 10210333232200200031212 |
5 | 10114340440340324220 |
6 | 110453400115055050 |
7 | 4145446002334305 |
oct | 444775640401546 |
9 | 78254624723363 |
10 | 20134513214310 |
11 | 6462aa9892950 |
12 | 23122538a1486 |
13 | b308a420a981 |
14 | 4d8730cb243c |
15 | 24db290481e0 |
hex | 124fee820366 |
20134513214310 has 64 divisors (see below), whose sum is σ = 53182328163840. Its totient is φ = 4837898580480.
The previous prime is 20134513214251. The next prime is 20134513214323. The reversal of 20134513214310 is 1341231543102.
It is a super-2 number, since 2×201345132143102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 269934730 + ... + 270009309.
It is an arithmetic number, because the mean of its divisors is an integer number (830973877560).
Almost surely, 220134513214310 is an apocalyptic number.
20134513214310 is an abundant number, since it is smaller than the sum of its proper divisors (33047814949530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20134513214310 is a wasteful number, since it uses less digits than its factorization.
20134513214310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539944173.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 20134513214310 its reverse (1341231543102), we get a palindrome (21475744757412).
It can be divided in two parts, 2013451 and 3214310, that added together give a triangular number (5227761 = T3233).
The spelling of 20134513214310 in words is "twenty trillion, one hundred thirty-four billion, five hundred thirteen million, two hundred fourteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.425 sec. • engine limits •