Base | Representation |
---|---|
bin | 10101101100111111… |
… | …011010111101010101 |
3 | 2020011001110102221002 |
4 | 111230333122331111 |
5 | 340211132320201 |
6 | 14412212433045 |
7 | 1453323433325 |
oct | 255477327525 |
9 | 66131412832 |
10 | 23303401301 |
11 | 9979187344 |
12 | 4624318785 |
13 | 2274bab16b |
14 | 11b0d09285 |
15 | 915c9176b |
hex | 56cfdaf55 |
23303401301 has 4 divisors (see below), whose sum is σ = 23743088172. Its totient is φ = 22863714432.
The previous prime is 23303401283. The next prime is 23303401307. The reversal of 23303401301 is 10310430332.
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 5939014225 + 17364387076 = 77065^2 + 131774^2 .
It is a cyclic number.
It is not a de Polignac number, because 23303401301 - 234 = 6123532117 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 (23303401307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 219843356 + ... + 219843461.
It is an arithmetic number, because the mean of its divisors is an integer number (5935772043).
Almost surely, 223303401301 is an apocalyptic number.
It is an amenable number.
23303401301 is a deficient number, since it is larger than the sum of its proper divisors (439686871).
23303401301 is an equidigital number, since it uses as much as digits as its factorization.
23303401301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439686870.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 23303401301 its reverse (10310430332), we get a palindrome (33613831633).
The spelling of 23303401301 in words is "twenty-three billion, three hundred three million, four hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •