Base | Representation |
---|---|
bin | 1001001111001000111110… |
… | …01110110110101001001011 |
3 | 2122220202100002021122101212 |
4 | 10213210133032312221023 |
5 | 10130240244112032230 |
6 | 111110534534203335 |
7 | 4164311013114566 |
oct | 447443716665113 |
9 | 78822302248355 |
10 | 20311424330315 |
11 | 6521032575838 |
12 | 23405a6ab354b |
13 | b44488c199c1 |
14 | 5031147694dd |
15 | 2535304a1895 |
hex | 12791f3b6a4b |
20311424330315 has 4 divisors (see below), whose sum is σ = 24373709196384. Its totient is φ = 16249139464248.
The previous prime is 20311424330311. The next prime is 20311424330317. The reversal of 20311424330315 is 51303342411302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20311424330315 - 22 = 20311424330311 is a prime.
It is a super-2 number, since 2×203114243303152 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20311424330311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2031142433027 + ... + 2031142433036.
It is an arithmetic number, because the mean of its divisors is an integer number (6093427299096).
Almost surely, 220311424330315 is an apocalyptic number.
20311424330315 is a deficient number, since it is larger than the sum of its proper divisors (4062284866069).
20311424330315 is an equidigital number, since it uses as much as digits as its factorization.
20311424330315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4062284866068.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 20311424330315 its reverse (51303342411302), we get a palindrome (71614766741617).
The spelling of 20311424330315 in words is "twenty trillion, three hundred eleven billion, four hundred twenty-four million, three hundred thirty thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •