Base | Representation |
---|---|
bin | 110100000011001100000011… |
… | …010010001011100001010011 |
3 | 1010000112022010100121012102021 |
4 | 310003030003102023201103 |
5 | 220001041033323210211 |
6 | 2130511131105232311 |
7 | 66134513321256364 |
oct | 6403140322134123 |
9 | 1100468110535367 |
10 | 228917517006931 |
11 | 66a38412534a45 |
12 | 218118b9332697 |
13 | 9a96aa1a7430c |
14 | 407594a127b6b |
15 | 1b6ea0b166771 |
hex | d0330348b853 |
228917517006931 has 2 divisors, whose sum is σ = 228917517006932. Its totient is φ = 228917517006930.
The previous prime is 228917517006887. The next prime is 228917517006947. The reversal of 228917517006931 is 139600715719822.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 228917517006931 - 243 = 220121423984723 is a prime.
It is a super-2 number, since 2×2289175170069312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 228917517006931.
It is not a weakly prime, because it can be changed into another prime (228987517006931) 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, 114458758503465 + 114458758503466.
It is an arithmetic number, because the mean of its divisors is an integer number (114458758503466).
Almost surely, 2228917517006931 is an apocalyptic number.
228917517006931 is a deficient number, since it is larger than the sum of its proper divisors (1).
228917517006931 is an equidigital number, since it uses as much as digits as its factorization.
228917517006931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11430720, while the sum is 61.
The spelling of 228917517006931 in words is "two hundred twenty-eight trillion, nine hundred seventeen billion, five hundred seventeen million, six thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •