Base | Representation |
---|---|
bin | 10101011011100111… |
… | …110110110100110001 |
3 | 2012101202011022000022 |
4 | 111123213312310301 |
5 | 334112033330223 |
6 | 14323243133225 |
7 | 1443154603664 |
oct | 253347666461 |
9 | 65352138008 |
10 | 23012011313 |
11 | 9839753775 |
12 | 4562814215 |
13 | 2229706355 |
14 | 11843376db |
15 | 8ea3d3ac8 |
hex | 55b9f6d31 |
23012011313 has 4 divisors (see below), whose sum is σ = 24012533568. Its totient is φ = 22011489060.
The previous prime is 23012011271. The next prime is 23012011327. The reversal of 23012011313 is 31311021032.
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 23012011313 - 218 = 23011749169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23012011291 and 23012011300.
It is not an unprimeable number, because it can be changed into a prime (23012011013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500261093 + ... + 500261138.
It is an arithmetic number, because the mean of its divisors is an integer number (6003133392).
Almost surely, 223012011313 is an apocalyptic number.
23012011313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
23012011313 is a deficient number, since it is larger than the sum of its proper divisors (1000522255).
23012011313 is a wasteful number, since it uses less digits than its factorization.
23012011313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000522254.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 23012011313 its reverse (31311021032), we get a palindrome (54323032345).
The spelling of 23012011313 in words is "twenty-three billion, twelve million, eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •