Base | Representation |
---|---|
bin | 10101011010111011… |
… | …001111111001011011 |
3 | 2012100221011012011021 |
4 | 111122323033321123 |
5 | 334101040130111 |
6 | 14322144343311 |
7 | 1442653321222 |
oct | 253273177133 |
9 | 65327135137 |
10 | 23000317531 |
11 | 9833096a94 |
12 | 455a914b37 |
13 | 2227170859 |
14 | 1182971cb9 |
15 | 8e9373d71 |
hex | 55aecfe5b |
23000317531 has 4 divisors (see below), whose sum is σ = 23025346000. Its totient is φ = 22975289064.
The previous prime is 23000317471. The next prime is 23000317547. The reversal of 23000317531 is 13571300032.
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 23000317531 - 223 = 22991928923 is a prime.
It is a super-2 number, since 2×230003175312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23000317496 and 23000317505.
It is not an unprimeable number, because it can be changed into a prime (23000317591) 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 3 ways as a sum of consecutive naturals, for example, 12512856 + ... + 12514693.
It is an arithmetic number, because the mean of its divisors is an integer number (5756336500).
Almost surely, 223000317531 is an apocalyptic number.
23000317531 is a deficient number, since it is larger than the sum of its proper divisors (25028469).
23000317531 is an equidigital number, since it uses as much as digits as its factorization.
23000317531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25028468.
The product of its (nonzero) digits is 1890, while the sum is 25.
Adding to 23000317531 its reverse (13571300032), we get a palindrome (36571617563).
The spelling of 23000317531 in words is "twenty-three billion, three hundred seventeen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •