Base | Representation |
---|---|
bin | 1001001111001011111010… |
… | …11110010001101011111111 |
3 | 2122220220102021101220112220 |
4 | 10213211331132101223333 |
5 | 10130302013342302201 |
6 | 111111355454500423 |
7 | 4164365132213310 |
oct | 447457536215377 |
9 | 78826367356486 |
10 | 20313005431551 |
11 | 6521774009578 |
12 | 2340968504713 |
13 | b4467b666671 |
14 | 503224740607 |
15 | 2535c41bb036 |
hex | 12797d791aff |
20313005431551 has 32 divisors (see below), whose sum is σ = 32589079511040. Its totient is φ = 10994214102624.
The previous prime is 20313005431549. The next prime is 20313005431613. The reversal of 20313005431551 is 15513450031302.
It is not a de Polignac number, because 20313005431551 - 21 = 20313005431549 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20313105431551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3413535 + ... + 7230368.
It is an arithmetic number, because the mean of its divisors is an integer number (1018408734720).
Almost surely, 220313005431551 is an apocalyptic number.
20313005431551 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20313005431551 is a deficient number, since it is larger than the sum of its proper divisors (12276074079489).
20313005431551 is a wasteful number, since it uses less digits than its factorization.
20313005431551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10648715.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 20313005431551 its reverse (15513450031302), we get a palindrome (35826455462853).
The spelling of 20313005431551 in words is "twenty trillion, three hundred thirteen billion, five million, four hundred thirty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •