Base | Representation |
---|---|
bin | 100011000000100101000… |
… | …0101110001000111110111 |
3 | 122000222121010022112001022 |
4 | 1012001022011301013313 |
5 | 1112313132214204211 |
6 | 14122231011451355 |
7 | 1004425043363411 |
oct | 106011205610767 |
9 | 18028533275038 |
10 | 4811606397431 |
11 | 1595655411559 |
12 | 6586312b6b5b |
13 | 28b96a4c81a2 |
14 | 128c50d059b1 |
15 | 852631bebdb |
hex | 4604a1711f7 |
4811606397431 has 2 divisors, whose sum is σ = 4811606397432. Its totient is φ = 4811606397430.
The previous prime is 4811606397413. The next prime is 4811606397503. The reversal of 4811606397431 is 1347936061184.
It is a happy number.
Together with previous prime (4811606397413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4811606397431 - 210 = 4811606396407 is a prime.
It is a super-2 number, since 2×48116063974312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4811606367431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2405803198715 + 2405803198716.
It is an arithmetic number, because the mean of its divisors is an integer number (2405803198716).
Almost surely, 24811606397431 is an apocalyptic number.
4811606397431 is a deficient number, since it is larger than the sum of its proper divisors (1).
4811606397431 is an equidigital number, since it uses as much as digits as its factorization.
4811606397431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 53.
The spelling of 4811606397431 in words is "four trillion, eight hundred eleven billion, six hundred six million, three hundred ninety-seven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •