Base | Representation |
---|---|
bin | 10101011010111010… |
… | …000011010000010111 |
3 | 2012100220120020112110 |
4 | 111122322003100113 |
5 | 334101000103412 |
6 | 14322133522103 |
7 | 1442650543050 |
oct | 253272032027 |
9 | 65326506473 |
10 | 23000003607 |
11 | 98329a2149 |
12 | 455a7a3333 |
13 | 22270909b9 |
14 | 11828cd727 |
15 | 8e9310d3c |
hex | 55ae83417 |
23000003607 has 8 divisors (see below), whose sum is σ = 35047624576. Its totient is φ = 13142859192.
The previous prime is 23000003531. The next prime is 23000003641. The reversal of 23000003607 is 70630000032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23000003607 - 27 = 23000003479 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 1095238267 = 23000003607 / (2 + 3 + 0 + 0 + 0 + 0 + 0 + 3 + 6 + 0 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23000503607) 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 7 ways as a sum of consecutive naturals, for example, 547619113 + ... + 547619154.
It is an arithmetic number, because the mean of its divisors is an integer number (4380953072).
Almost surely, 223000003607 is an apocalyptic number.
23000003607 is a deficient number, since it is larger than the sum of its proper divisors (12047620969).
23000003607 is a wasteful number, since it uses less digits than its factorization.
23000003607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095238277.
The product of its (nonzero) digits is 756, while the sum is 21.
Adding to 23000003607 its reverse (70630000032), we get a palindrome (93630003639).
The spelling of 23000003607 in words is "twenty-three billion, three thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •