Base | Representation |
---|---|
bin | 10101011011000001… |
… | …101101001011011011 |
3 | 2012101001100012020120 |
4 | 111123001231023123 |
5 | 334102003312311 |
6 | 14322244524323 |
7 | 1443003601416 |
oct | 253301551333 |
9 | 65331305216 |
10 | 23002010331 |
11 | 98340428a3 |
12 | 455b3b06a3 |
13 | 2227614201 |
14 | 1182c92b7d |
15 | 8e95aa706 |
hex | 55b06d2db |
23002010331 has 4 divisors (see below), whose sum is σ = 30669347112. Its totient is φ = 15334673552.
The previous prime is 23002010321. The next prime is 23002010333. The reversal of 23002010331 is 13301020032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23002010331 - 26 = 23002010267 is a prime.
It is a super-2 number, since 2×230020103312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23002010331.
It is not an unprimeable number, because it can be changed into a prime (23002010333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3833668386 + ... + 3833668391.
It is an arithmetic number, because the mean of its divisors is an integer number (7667336778).
Almost surely, 223002010331 is an apocalyptic number.
23002010331 is a deficient number, since it is larger than the sum of its proper divisors (7667336781).
23002010331 is an equidigital number, since it uses as much as digits as its factorization.
23002010331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7667336780.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 23002010331 its reverse (13301020032), we get a palindrome (36303030363).
The spelling of 23002010331 in words is "twenty-three billion, two million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •