Base | Representation |
---|---|
bin | 110010110100111101110110… |
… | …100000111111100101011011 |
3 | 1002022111102100212112011020121 |
4 | 302310331312200333211123 |
5 | 213300003311202343301 |
6 | 2111233502505134111 |
7 | 65041246620030145 |
oct | 6264756640774533 |
9 | 1068442325464217 |
10 | 223542151215451 |
11 | 6525576a6a1602 |
12 | 210a3b7218a337 |
13 | 9796c1bb83383 |
14 | 3d2b6d8147c95 |
15 | 1ac9c9ea663a1 |
hex | cb4f7683f95b |
223542151215451 has 2 divisors, whose sum is σ = 223542151215452. Its totient is φ = 223542151215450.
The previous prime is 223542151215371. The next prime is 223542151215499. The reversal of 223542151215451 is 154512151245322.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 223542151215451 - 27 = 223542151215323 is a prime.
It is a super-2 number, since 2×2235421512154512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 223542151215398 and 223542151215407.
It is not a weakly prime, because it can be changed into another prime (223542155215451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111771075607725 + 111771075607726.
It is an arithmetic number, because the mean of its divisors is an integer number (111771075607726).
Almost surely, 2223542151215451 is an apocalyptic number.
223542151215451 is a deficient number, since it is larger than the sum of its proper divisors (1).
223542151215451 is an equidigital number, since it uses as much as digits as its factorization.
223542151215451 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 480000, while the sum is 43.
The spelling of 223542151215451 in words is "two hundred twenty-three trillion, five hundred forty-two billion, one hundred fifty-one million, two hundred fifteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •