Base | Representation |
---|---|
bin | 1010011110111001111100… |
… | …00101101001001101010011 |
3 | 10000121202120122200022102122 |
4 | 11033130332011221031103 |
5 | 11010141231033111111 |
6 | 121010000341004455 |
7 | 4566314204502056 |
oct | 517347605511523 |
9 | 100552518608378 |
10 | 23052131144531 |
11 | 7388399077235 |
12 | 27037a80b372b |
13 | cb2a64257408 |
14 | 599a2c91aa9d |
15 | 29e98b0d9cdb |
hex | 14f73e169353 |
23052131144531 has 2 divisors, whose sum is σ = 23052131144532. Its totient is φ = 23052131144530.
The previous prime is 23052131144473. The next prime is 23052131144561. The reversal of 23052131144531 is 13544113125032.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23052131144531 - 26 = 23052131144467 is a prime.
It is a super-3 number, since 3×230521311445313 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 23052131144491 and 23052131144500.
It is not a weakly prime, because it can be changed into another prime (23052131144561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11526065572265 + 11526065572266.
It is an arithmetic number, because the mean of its divisors is an integer number (11526065572266).
Almost surely, 223052131144531 is an apocalyptic number.
23052131144531 is a deficient number, since it is larger than the sum of its proper divisors (1).
23052131144531 is an equidigital number, since it uses as much as digits as its factorization.
23052131144531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 23052131144531 its reverse (13544113125032), we get a palindrome (36596244269563).
The spelling of 23052131144531 in words is "twenty-three trillion, fifty-two billion, one hundred thirty-one million, one hundred forty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •