Base | Representation |
---|---|
bin | 1010100110111111100100… |
… | …10101111100010111100001 |
3 | 10001121022220010110121210122 |
4 | 11103133302111330113201 |
5 | 11024214402001120022 |
6 | 121341400323010025 |
7 | 4625352654261554 |
oct | 523376225742741 |
9 | 101538803417718 |
10 | 23330033223137 |
11 | 74852365a6083 |
12 | 2749624b09915 |
13 | 1003021b6a694 |
14 | 5a9272cac69b |
15 | 2a6d03776742 |
hex | 1537f257c5e1 |
23330033223137 has 2 divisors, whose sum is σ = 23330033223138. Its totient is φ = 23330033223136.
The previous prime is 23330033223061. The next prime is 23330033223169. The reversal of 23330033223137 is 73132233003332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15518880238801 + 7811152984336 = 3939401^2 + 2794844^2 .
It is a cyclic number.
It is not a de Polignac number, because 23330033223137 - 212 = 23330033219041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23330033223097 and 23330033223106.
It is not a weakly prime, because it can be changed into another prime (23330033223737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11665016611568 + 11665016611569.
It is an arithmetic number, because the mean of its divisors is an integer number (11665016611569).
Almost surely, 223330033223137 is an apocalyptic number.
It is an amenable number.
23330033223137 is a deficient number, since it is larger than the sum of its proper divisors (1).
23330033223137 is an equidigital number, since it uses as much as digits as its factorization.
23330033223137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 122472, while the sum is 35.
Adding to 23330033223137 its reverse (73132233003332), we get a palindrome (96462266226469).
The spelling of 23330033223137 in words is "twenty-three trillion, three hundred thirty billion, thirty-three million, two hundred twenty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •