Base | Representation |
---|---|
bin | 10010111010110000… |
… | …010111101011000001 |
3 | 1221102122200222010002 |
4 | 102322300113223001 |
5 | 313100124024413 |
6 | 13155352245345 |
7 | 1316243411432 |
oct | 227260275301 |
9 | 57378628102 |
10 | 20313111233 |
11 | 8684249138 |
12 | 3b2a9a0855 |
13 | 1bb951645c |
14 | da9b0d489 |
15 | 7dd4b9958 |
hex | 4bac17ac1 |
20313111233 has 4 divisors (see below), whose sum is σ = 20418360708. Its totient is φ = 20207861760.
The previous prime is 20313111229. The next prime is 20313111241. The reversal of 20313111233 is 33211131302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5465201329 + 14847909904 = 73927^2 + 121852^2 .
It is a cyclic number.
It is not a de Polignac number, because 20313111233 - 22 = 20313111229 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20313111253) 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 3 ways as a sum of consecutive naturals, for example, 52624448 + ... + 52624833.
It is an arithmetic number, because the mean of its divisors is an integer number (5104590177).
Almost surely, 220313111233 is an apocalyptic number.
It is an amenable number.
20313111233 is a deficient number, since it is larger than the sum of its proper divisors (105249475).
20313111233 is a wasteful number, since it uses less digits than its factorization.
20313111233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105249474.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 20313111233 its reverse (33211131302), we get a palindrome (53524242535).
The spelling of 20313111233 in words is "twenty billion, three hundred thirteen million, one hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •