Base | Representation |
---|---|
bin | 1001001111001100011001… |
… | …10010001111101100110011 |
3 | 2122220221002011210102110201 |
4 | 10213212030302033230303 |
5 | 10130303030123341111 |
6 | 111111441152540031 |
7 | 4164404401604401 |
oct | 447461462175463 |
9 | 78827064712421 |
10 | 20313262324531 |
11 | 6521896020020 |
12 | 2340a1a551617 |
13 | b446bc950647 |
14 | 50324a8d2471 |
15 | 2535dba126c1 |
hex | 12798cc8fb33 |
20313262324531 has 8 divisors (see below), whose sum is σ = 22472034121728. Its totient is φ = 18206509125000.
The previous prime is 20313262324513. The next prime is 20313262324613. The reversal of 20313262324531 is 13542326231302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20313262324531 - 243 = 11517169302323 is a prime.
It is a super-2 number, since 2×203132623245312 (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 (20313262384531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13004648595 + ... + 13004650156.
It is an arithmetic number, because the mean of its divisors is an integer number (2809004265216).
Almost surely, 220313262324531 is an apocalyptic number.
20313262324531 is a deficient number, since it is larger than the sum of its proper divisors (2158771797197).
20313262324531 is a wasteful number, since it uses less digits than its factorization.
20313262324531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26009298833.
The product of its (nonzero) digits is 155520, while the sum is 37.
Adding to 20313262324531 its reverse (13542326231302), we get a palindrome (33855588555833).
The spelling of 20313262324531 in words is "twenty trillion, three hundred thirteen billion, two hundred sixty-two million, three hundred twenty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •