Base | Representation |
---|---|
bin | 10101100111011011… |
… | …001011011001011101 |
3 | 2012220112201220001022 |
4 | 111213123023121131 |
5 | 340013230424201 |
6 | 14355035053525 |
7 | 1451110603115 |
oct | 254733133135 |
9 | 65815656038 |
10 | 23210014301 |
11 | 99304a2301 |
12 | 45b8ba12a5 |
13 | 225b741696 |
14 | 11a275a045 |
15 | 90c99641b |
hex | 5676cb65d |
23210014301 has 4 divisors (see below), whose sum is σ = 23234999100. Its totient is φ = 23185029504.
The previous prime is 23210014297. The next prime is 23210014313. The reversal of 23210014301 is 10341001232.
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 1738973401 + 21471040900 = 41701^2 + 146530^2 .
It is a cyclic number.
It is not a de Polignac number, because 23210014301 - 22 = 23210014297 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 23210014301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23210014361) 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, 12491006 + ... + 12492863.
It is an arithmetic number, because the mean of its divisors is an integer number (5808749775).
Almost surely, 223210014301 is an apocalyptic number.
It is an amenable number.
23210014301 is a deficient number, since it is larger than the sum of its proper divisors (24984799).
23210014301 is an equidigital number, since it uses as much as digits as its factorization.
23210014301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24984798.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 23210014301 its reverse (10341001232), we get a palindrome (33551015533).
The spelling of 23210014301 in words is "twenty-three billion, two hundred ten million, fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •