Base | Representation |
---|---|
bin | 111111010100010011111… |
… | …000110010000100001001 |
3 | 120101222001010010110010112 |
4 | 333110103320302010021 |
5 | 1032242111143214311 |
6 | 13130514542524105 |
7 | 626234123465234 |
oct | 77242370620411 |
9 | 16358033113115 |
10 | 4351135523081 |
11 | 1428340629246 |
12 | 5a3342596635 |
13 | 257405a048b9 |
14 | 11084b91a41b |
15 | 782b2a6028b |
hex | 3f513e32109 |
4351135523081 has 2 divisors, whose sum is σ = 4351135523082. Its totient is φ = 4351135523080.
The previous prime is 4351135523069. The next prime is 4351135523083. The reversal of 4351135523081 is 1803255311534.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4348142448400 + 2993074681 = 2085220^2 + 54709^2 .
It is a cyclic number.
It is not a de Polignac number, because 4351135523081 - 218 = 4351135260937 is a prime.
It is a super-2 number, since 2×43511355230812 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 4351135523083, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (4351135523083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2175567761540 + 2175567761541.
It is an arithmetic number, because the mean of its divisors is an integer number (2175567761541).
Almost surely, 24351135523081 is an apocalyptic number.
It is an amenable number.
4351135523081 is a deficient number, since it is larger than the sum of its proper divisors (1).
4351135523081 is an equidigital number, since it uses as much as digits as its factorization.
4351135523081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216000, while the sum is 41.
The spelling of 4351135523081 in words is "four trillion, three hundred fifty-one billion, one hundred thirty-five million, five hundred twenty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •