Base | Representation |
---|---|
bin | 10101100011010101… |
… | …001111111111100001 |
3 | 2012201202112110020122 |
4 | 111203111033333201 |
5 | 334343141221033 |
6 | 14344143250025 |
7 | 1446315145526 |
oct | 254325177741 |
9 | 65652473218 |
10 | 23141351393 |
11 | 98a57648a6 |
12 | 4599ba9915 |
13 | 224a450644 |
14 | 11975a514d |
15 | 906931a98 |
hex | 56354ffe1 |
23141351393 has 2 divisors, whose sum is σ = 23141351394. Its totient is φ = 23141351392.
The previous prime is 23141351339. The next prime is 23141351407. The reversal of 23141351393 is 39315314132.
Together with previous prime (23141351339) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16442419984 + 6698931409 = 128228^2 + 81847^2 .
It is a cyclic number.
It is not a de Polignac number, because 23141351393 - 222 = 23137157089 is a prime.
It is not a weakly prime, because it can be changed into another prime (23141351693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11570675696 + 11570675697.
It is an arithmetic number, because the mean of its divisors is an integer number (11570675697).
Almost surely, 223141351393 is an apocalyptic number.
It is an amenable number.
23141351393 is a deficient number, since it is larger than the sum of its proper divisors (1).
23141351393 is an equidigital number, since it uses as much as digits as its factorization.
23141351393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29160, while the sum is 35.
The spelling of 23141351393 in words is "twenty-three billion, one hundred forty-one million, three hundred fifty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •