Base | Representation |
---|---|
bin | 111100010000101000101… |
… | …000010010000100000011 |
3 | 112122212201111202012001001 |
4 | 330100220220102010003 |
5 | 1020321312202343411 |
6 | 12450210222552431 |
7 | 605115405156556 |
oct | 74205050220403 |
9 | 15585644665031 |
10 | 4141030121731 |
11 | 1357223602488 |
12 | 56a686738717 |
13 | 240660c130c9 |
14 | 1045d96ba69d |
15 | 72ab735cdc1 |
hex | 3c428a12103 |
4141030121731 has 2 divisors, whose sum is σ = 4141030121732. Its totient is φ = 4141030121730.
The previous prime is 4141030121729. The next prime is 4141030121759. The reversal of 4141030121731 is 1371210301414.
It is an a-pointer prime, because the next prime (4141030121759) can be obtained adding 4141030121731 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4141030121731 - 21 = 4141030121729 is a prime.
It is a super-2 number, since 2×41410301217312 (a number of 26 digits) contains 22 as substring.
Together with 4141030121729, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 4141030121731.
It is not a weakly prime, because it can be changed into another prime (4141030121131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2070515060865 + 2070515060866.
It is an arithmetic number, because the mean of its divisors is an integer number (2070515060866).
Almost surely, 24141030121731 is an apocalyptic number.
4141030121731 is a deficient number, since it is larger than the sum of its proper divisors (1).
4141030121731 is an equidigital number, since it uses as much as digits as its factorization.
4141030121731 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 28.
The spelling of 4141030121731 in words is "four trillion, one hundred forty-one billion, thirty million, one hundred twenty-one thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •