Base | Representation |
---|---|
bin | 10101011011000001… |
… | …101101001001011001 |
3 | 2012101001100012001202 |
4 | 111123001231021121 |
5 | 334102003311301 |
6 | 14322244523545 |
7 | 1443003601142 |
oct | 253301551131 |
9 | 65331305052 |
10 | 23002010201 |
11 | 9834042795 |
12 | 455b3b05b5 |
13 | 2227614131 |
14 | 1182c92ac9 |
15 | 8e95aa66b |
hex | 55b06d259 |
23002010201 has 4 divisors (see below), whose sum is σ = 23143126992. Its totient is φ = 22860893412.
The previous prime is 23002010197. The next prime is 23002010203. The reversal of 23002010201 is 10201020032.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23002010201 - 22 = 23002010197 is a prime.
It is a super-3 number, since 3×230020102013 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23002010203) 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, 70558151 + ... + 70558476.
It is an arithmetic number, because the mean of its divisors is an integer number (5785781748).
Almost surely, 223002010201 is an apocalyptic number.
It is an amenable number.
23002010201 is a deficient number, since it is larger than the sum of its proper divisors (141116791).
23002010201 is a wasteful number, since it uses less digits than its factorization.
23002010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141116790.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 23002010201 its reverse (10201020032), we get a palindrome (33203030233).
The spelling of 23002010201 in words is "twenty-three billion, two million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •