Base | Representation |
---|---|
bin | 110100110111010111011011… |
… | …001101010000110100101011 |
3 | 1010111020002020202012211221002 |
4 | 310313113123031100310223 |
5 | 220433312413413241301 |
6 | 2142254245151505215 |
7 | 66654540416463461 |
oct | 6467273315206453 |
9 | 1114202222184832 |
10 | 232503142321451 |
11 | 680a0035550261 |
12 | 220b07bbb2820b |
13 | 9c96c4c105661 |
14 | 415b2d8136831 |
15 | 1bd2e1878216b |
hex | d375db350d2b |
232503142321451 has 2 divisors, whose sum is σ = 232503142321452. Its totient is φ = 232503142321450.
The previous prime is 232503142321313. The next prime is 232503142321453. The reversal of 232503142321451 is 154123241305232.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232503142321451 is a prime.
It is a super-2 number, since 2×2325031423214512 (a number of 30 digits) contains 22 as substring.
Together with 232503142321453, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (232503142321453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116251571160725 + 116251571160726.
It is an arithmetic number, because the mean of its divisors is an integer number (116251571160726).
Almost surely, 2232503142321451 is an apocalyptic number.
232503142321451 is a deficient number, since it is larger than the sum of its proper divisors (1).
232503142321451 is an equidigital number, since it uses as much as digits as its factorization.
232503142321451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 232503142321451 its reverse (154123241305232), we get a palindrome (386626383626683).
The spelling of 232503142321451 in words is "two hundred thirty-two trillion, five hundred three billion, one hundred forty-two million, three hundred twenty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •