Base | Representation |
---|---|
bin | 111011101011110010110… |
… | …000000101111101011101 |
3 | 112112002121121012200102221 |
4 | 323223302300011331131 |
5 | 1014144303200301411 |
6 | 12420105012145341 |
7 | 602215200322411 |
oct | 73536260057535 |
9 | 15462547180387 |
10 | 4101471493981 |
11 | 13414738079a4 |
12 | 562a86608251 |
13 | 2399c8429474 |
14 | 1027259a2d41 |
15 | 71a4e4ad071 |
hex | 3baf2c05f5d |
4101471493981 has 2 divisors, whose sum is σ = 4101471493982. Its totient is φ = 4101471493980.
The previous prime is 4101471493979. The next prime is 4101471493991. The reversal of 4101471493981 is 1893941741014.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4093459632900 + 8011861081 = 2023230^2 + 89509^2 .
It is a cyclic number.
It is not a de Polignac number, because 4101471493981 - 21 = 4101471493979 is a prime.
It is a super-3 number, since 3×41014714939813 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 4101471493979, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4101471493921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2050735746990 + 2050735746991.
It is an arithmetic number, because the mean of its divisors is an integer number (2050735746991).
Almost surely, 24101471493981 is an apocalyptic number.
It is an amenable number.
4101471493981 is a deficient number, since it is larger than the sum of its proper divisors (1).
4101471493981 is an equidigital number, since it uses as much as digits as its factorization.
4101471493981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 870912, while the sum is 52.
The spelling of 4101471493981 in words is "four trillion, one hundred one billion, four hundred seventy-one million, four hundred ninety-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •