Base | Representation |
---|---|
bin | 110000111110100000110010… |
… | …010000101011100010011111 |
3 | 1001020200020022201221010120201 |
4 | 300332200302100223202133 |
5 | 211213121341010444211 |
6 | 2042042155453124331 |
7 | 63241166300251441 |
oct | 6076406220534237 |
9 | 1036606281833521 |
10 | 215402043062431 |
11 | 626a7547875275 |
12 | 201aa4384896a7 |
13 | 9326430190774 |
14 | 3b2972bb66491 |
15 | 19d817c6690c1 |
hex | c3e83242b89f |
215402043062431 has 2 divisors, whose sum is σ = 215402043062432. Its totient is φ = 215402043062430.
The previous prime is 215402043062417. The next prime is 215402043062441. The reversal of 215402043062431 is 134260340204512.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 215402043062431 - 213 = 215402043054239 is a prime.
It is a super-2 number, since 2×2154020430624312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (215402043062441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107701021531215 + 107701021531216.
It is an arithmetic number, because the mean of its divisors is an integer number (107701021531216).
Almost surely, 2215402043062431 is an apocalyptic number.
215402043062431 is a deficient number, since it is larger than the sum of its proper divisors (1).
215402043062431 is an equidigital number, since it uses as much as digits as its factorization.
215402043062431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 37.
Adding to 215402043062431 its reverse (134260340204512), we get a palindrome (349662383266943).
The spelling of 215402043062431 in words is "two hundred fifteen trillion, four hundred two billion, forty-three million, sixty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •