Base | Representation |
---|---|
bin | 1001001101100000100010… |
… | …00100010001010111010111 |
3 | 2122201101121022111020011110 |
4 | 10212300101010101113113 |
5 | 10123330430114202221 |
6 | 111025102535510103 |
7 | 4160254336041426 |
oct | 446602104212727 |
9 | 78641538436143 |
10 | 20255352100311 |
11 | 64aa279228489 |
12 | 2331758528333 |
13 | b3c0c1141693 |
14 | 5005157c72bd |
15 | 251d4c9a7776 |
hex | 126c111115d7 |
20255352100311 has 8 divisors (see below), whose sum is σ = 27051628946944. Its totient is φ = 13481321660280.
The previous prime is 20255352100189. The next prime is 20255352100343. The reversal of 20255352100311 is 11300125355202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20255352100311 - 213 = 20255352092119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20255352102311) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5561599525 + ... + 5561603166.
It is an arithmetic number, because the mean of its divisors is an integer number (3381453618368).
Almost surely, 220255352100311 is an apocalyptic number.
20255352100311 is a deficient number, since it is larger than the sum of its proper divisors (6796276846633).
20255352100311 is a wasteful number, since it uses less digits than its factorization.
20255352100311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11123203301.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 20255352100311 its reverse (11300125355202), we get a palindrome (31555477455513).
The spelling of 20255352100311 in words is "twenty trillion, two hundred fifty-five billion, three hundred fifty-two million, one hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •