Base | Representation |
---|---|
bin | 10101011100010011… |
… | …010110000010000101 |
3 | 2012102112121110220021 |
4 | 111130103112002011 |
5 | 334122443130313 |
6 | 14324331335141 |
7 | 1443353524126 |
oct | 253423260205 |
9 | 65375543807 |
10 | 23023411333 |
11 | 984512a77a |
12 | 45665b14b1 |
13 | 222bb98220 |
14 | 1185a6404d |
15 | 8eb3d678d |
hex | 55c4d6085 |
23023411333 has 4 divisors (see below), whose sum is σ = 24794442988. Its totient is φ = 21252379680.
The previous prime is 23023411303. The next prime is 23023411343. The reversal of 23023411333 is 33311432032.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4401260964 + 18622150369 = 66342^2 + 136463^2 .
It is a cyclic number.
It is not a de Polignac number, because 23023411333 - 229 = 22486540421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23023411298 and 23023411307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23023411303) 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, 885515808 + ... + 885515833.
It is an arithmetic number, because the mean of its divisors is an integer number (6198610747).
Almost surely, 223023411333 is an apocalyptic number.
It is an amenable number.
23023411333 is a deficient number, since it is larger than the sum of its proper divisors (1771031655).
23023411333 is a wasteful number, since it uses less digits than its factorization.
23023411333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1771031654.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 23023411333 its reverse (33311432032), we get a palindrome (56334843365).
The spelling of 23023411333 in words is "twenty-three billion, twenty-three million, four hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •