Base | Representation |
---|---|
bin | 10010101000111000… |
… | …101110010101001110 |
3 | 1220122202120112221020 |
4 | 102220320232111032 |
5 | 311441401430220 |
6 | 13105522415010 |
7 | 1305643224246 |
oct | 225070562516 |
9 | 56582515836 |
10 | 20013311310 |
11 | 853aaa1003 |
12 | 3a66501466 |
13 | 1b6c388755 |
14 | d7bd8cb26 |
15 | 7c1eea040 |
hex | 4a8e2e54e |
20013311310 has 32 divisors (see below), whose sum is σ = 50120294400. Its totient is φ = 5104844448.
The previous prime is 20013311299. The next prime is 20013311317. The reversal of 20013311310 is 1311331002.
It is a super-2 number, since 2×200133113102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 20013311310.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20013311317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14501710 + ... + 14503089.
It is an arithmetic number, because the mean of its divisors is an integer number (1566259200).
Almost surely, 220013311310 is an apocalyptic number.
20013311310 is an abundant number, since it is smaller than the sum of its proper divisors (30106983090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20013311310 is a wasteful number, since it uses less digits than its factorization.
20013311310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29004832.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 20013311310 its reverse (1311331002), we get a palindrome (21324642312).
The spelling of 20013311310 in words is "twenty billion, thirteen million, three hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •