Base | Representation |
---|---|
bin | 1010100011100110100011… |
… | …01011100010111100001001 |
3 | 10001012012011012101120201202 |
4 | 11101303101223202330021 |
5 | 11020312242401333113 |
6 | 121212051104153545 |
7 | 4614056456612645 |
oct | 521632153427411 |
9 | 101165135346652 |
10 | 23213521121033 |
11 | 743a887552301 |
12 | 272ab293088b5 |
13 | cc5044473329 |
14 | 5a377cc93c25 |
15 | 2a3c84adc258 |
hex | 151cd1ae2f09 |
23213521121033 has 2 divisors, whose sum is σ = 23213521121034. Its totient is φ = 23213521121032.
The previous prime is 23213521121027. The next prime is 23213521121081. The reversal of 23213521121033 is 33012112531232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12979613014729 + 10233908106304 = 3602723^2 + 3199048^2 .
It is a cyclic number.
It is not a de Polignac number, because 23213521121033 - 24 = 23213521121017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23213521120987 and 23213521121005.
It is not a weakly prime, because it can be changed into another prime (23213521121933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11606760560516 + 11606760560517.
It is an arithmetic number, because the mean of its divisors is an integer number (11606760560517).
Almost surely, 223213521121033 is an apocalyptic number.
It is an amenable number.
23213521121033 is a deficient number, since it is larger than the sum of its proper divisors (1).
23213521121033 is an equidigital number, since it uses as much as digits as its factorization.
23213521121033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 23213521121033 its reverse (33012112531232), we get a palindrome (56225633652265).
The spelling of 23213521121033 in words is "twenty-three trillion, two hundred thirteen billion, five hundred twenty-one million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •