Base | Representation |
---|---|
bin | 10101011010111011… |
… | …001011110111100111 |
3 | 2012100221010100112011 |
4 | 111122323023313213 |
5 | 334101034113111 |
6 | 14322144135051 |
7 | 1442653222141 |
oct | 253273136747 |
9 | 65327110464 |
10 | 23000301031 |
11 | 9833085654 |
12 | 455a907487 |
13 | 22271661a6 |
14 | 1182969c91 |
15 | 8e936e021 |
hex | 55aecbde7 |
23000301031 has 8 divisors (see below), whose sum is σ = 23207928480. Its totient is φ = 22792745472.
The previous prime is 23000301019. The next prime is 23000301151. The reversal of 23000301031 is 13010300032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23000301031 - 219 = 22999776743 is a prime.
It is a super-2 number, since 2×230003010312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23000331031) 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 7 ways as a sum of consecutive naturals, for example, 785551 + ... + 814303.
It is an arithmetic number, because the mean of its divisors is an integer number (2900991060).
Almost surely, 223000301031 is an apocalyptic number.
23000301031 is a deficient number, since it is larger than the sum of its proper divisors (207627449).
23000301031 is a wasteful number, since it uses less digits than its factorization.
23000301031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35945.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 23000301031 its reverse (13010300032), we get a palindrome (36010601063).
Subtracting from 23000301031 its reverse (13010300032), we obtain a palindrome (9990000999).
The spelling of 23000301031 in words is "twenty-three billion, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •