Base | Representation |
---|---|
bin | 10010111010101000… |
… | …110010010101100101 |
3 | 1221102111221222011222 |
4 | 102322220302111211 |
5 | 313044121421201 |
6 | 13155241510125 |
7 | 1316220461630 |
oct | 227250622545 |
9 | 57374858158 |
10 | 20311123301 |
11 | 8683110617 |
12 | 3b2a1a2345 |
13 | 1bb8c9b671 |
14 | da9752c17 |
15 | 7dd22591b |
hex | 4baa32565 |
20311123301 has 8 divisors (see below), whose sum is σ = 23346891264. Its totient is φ = 17308900080.
The previous prime is 20311123279. The next prime is 20311123319. The reversal of 20311123301 is 10332111302.
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 20311123301 - 210 = 20311122277 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20311123301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20311123361) 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 7 ways as a sum of consecutive naturals, for example, 8384885 + ... + 8387306.
It is an arithmetic number, because the mean of its divisors is an integer number (2918361408).
Almost surely, 220311123301 is an apocalyptic number.
It is an amenable number.
20311123301 is a deficient number, since it is larger than the sum of its proper divisors (3035767963).
20311123301 is a wasteful number, since it uses less digits than its factorization.
20311123301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16772371.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 20311123301 its reverse (10332111302), we get a palindrome (30643234603).
The spelling of 20311123301 in words is "twenty billion, three hundred eleven million, one hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •