Base | Representation |
---|---|
bin | 1010011110000011110000… |
… | …10111000000100111101101 |
3 | 10000111222111112002111021211 |
4 | 11033001320113000213231 |
5 | 11004202143231114313 |
6 | 120544350154354421 |
7 | 4564234331052052 |
oct | 517017027004755 |
9 | 100458445074254 |
10 | 23023044004333 |
11 | 737702214929a |
12 | 26ba02aa2ba11 |
13 | cb00aa03c159 |
14 | 59846d819029 |
15 | 29dd376cce3d |
hex | 14f0785c09ed |
23023044004333 has 2 divisors, whose sum is σ = 23023044004334. Its totient is φ = 23023044004332.
The previous prime is 23023044004253. The next prime is 23023044004391. The reversal of 23023044004333 is 33340044032032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20293421251684 + 2729622752649 = 4504822^2 + 1652157^2 .
It is a cyclic number.
It is not a de Polignac number, because 23023044004333 - 221 = 23023041907181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23023044004295 and 23023044004304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23023044004633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11511522002166 + 11511522002167.
It is an arithmetic number, because the mean of its divisors is an integer number (11511522002167).
Almost surely, 223023044004333 is an apocalyptic number.
It is an amenable number.
23023044004333 is a deficient number, since it is larger than the sum of its proper divisors (1).
23023044004333 is an equidigital number, since it uses as much as digits as its factorization.
23023044004333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 31.
Adding to 23023044004333 its reverse (33340044032032), we get a palindrome (56363088036365).
The spelling of 23023044004333 in words is "twenty-three trillion, twenty-three billion, forty-four million, four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •