Base | Representation |
---|---|
bin | 1001001111000110100100… |
… | …01110001100000100101010 |
3 | 2122220122000001010020011020 |
4 | 10213203102032030010222 |
5 | 10130230122332412224 |
6 | 111110202421513310 |
7 | 4164234004121460 |
oct | 447432216140452 |
9 | 78818001106136 |
10 | 20310132310314 |
11 | 652052a229010 |
12 | 23402a6272836 |
13 | b44311347022 |
14 | 503030d24830 |
15 | 2534a6d3ac79 |
hex | 1278d238c12a |
20310132310314 has 128 divisors (see below), whose sum is σ = 51206659246080. Its totient is φ = 5216817312000.
The previous prime is 20310132310291. The next prime is 20310132310333. The reversal of 20310132310314 is 41301323101302.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 38420277 + ... + 38945319.
It is an arithmetic number, because the mean of its divisors is an integer number (400052025360).
Almost surely, 220310132310314 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20310132310314, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25603329623040).
20310132310314 is an abundant number, since it is smaller than the sum of its proper divisors (30896526935766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20310132310314 is a wasteful number, since it uses less digits than its factorization.
20310132310314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525996.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 20310132310314 its reverse (41301323101302), we get a palindrome (61611455411616).
The spelling of 20310132310314 in words is "twenty trillion, three hundred ten billion, one hundred thirty-two million, three hundred ten thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •