Base | Representation |
---|---|
bin | 1010011101101111100101… |
… | …00111111010110000101001 |
3 | 10000110221112111200002121011 |
4 | 11032313302213322300221 |
5 | 11004013001322331431 |
6 | 120535355151543521 |
7 | 4563402011416222 |
oct | 516676247726051 |
9 | 100427474602534 |
10 | 23012210355241 |
11 | 7372472900398 |
12 | 26b7b0682aba1 |
13 | cac071719bc3 |
14 | 597b22a8c249 |
15 | 29d90154ccb1 |
hex | 14edf29fac29 |
23012210355241 has 2 divisors, whose sum is σ = 23012210355242. Its totient is φ = 23012210355240.
The previous prime is 23012210355221. The next prime is 23012210355257. The reversal of 23012210355241 is 14255301221032.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22886608160025 + 125602195216 = 4783995^2 + 354404^2 .
It is a cyclic number.
It is not a de Polignac number, because 23012210355241 - 25 = 23012210355209 is a prime.
It is a super-2 number, since 2×230122103552412 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23012210355221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11506105177620 + 11506105177621.
It is an arithmetic number, because the mean of its divisors is an integer number (11506105177621).
Almost surely, 223012210355241 is an apocalyptic number.
It is an amenable number.
23012210355241 is a deficient number, since it is larger than the sum of its proper divisors (1).
23012210355241 is an equidigital number, since it uses as much as digits as its factorization.
23012210355241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 23012210355241 its reverse (14255301221032), we get a palindrome (37267511576273).
The spelling of 23012210355241 in words is "twenty-three trillion, twelve billion, two hundred ten million, three hundred fifty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •