Base | Representation |
---|---|
bin | 10010110101011000… |
… | …101000001011010101 |
3 | 1221012101010220112012 |
4 | 102311120220023111 |
5 | 312404042020201 |
6 | 13142413034005 |
7 | 1314100450316 |
oct | 226530501325 |
9 | 57171126465 |
10 | 20223001301 |
11 | 86383a2218 |
12 | 3b04785905 |
13 | 1ba3956479 |
14 | d9bb7460d |
15 | 7d561a5bb |
hex | 4b56282d5 |
20223001301 has 4 divisors (see below), whose sum is σ = 20309795532. Its totient is φ = 20136207072.
The previous prime is 20223001289. The next prime is 20223001327. The reversal of 20223001301 is 10310032202.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10310032202 = 2 ⋅5155016101.
It can be written as a sum of positive squares in 2 ways, for example, as 4264743025 + 15958258276 = 65305^2 + 126326^2 .
It is a cyclic number.
It is not a de Polignac number, because 20223001301 - 210 = 20223000277 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 (20223001501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43396766 + ... + 43397231.
It is an arithmetic number, because the mean of its divisors is an integer number (5077448883).
Almost surely, 220223001301 is an apocalyptic number.
It is an amenable number.
20223001301 is a deficient number, since it is larger than the sum of its proper divisors (86794231).
20223001301 is an equidigital number, since it uses as much as digits as its factorization.
20223001301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86794230.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20223001301 its reverse (10310032202), we get a palindrome (30533033503).
The spelling of 20223001301 in words is "twenty billion, two hundred twenty-three million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •