Base | Representation |
---|---|
bin | 111111000001110010000… |
… | …110011110010101010111 |
3 | 120100001200122200221022112 |
4 | 333001302012132111113 |
5 | 1031430340240142403 |
6 | 13113424513221235 |
7 | 624631124615255 |
oct | 77016206362527 |
9 | 16301618627275 |
10 | 4331241334103 |
11 | 141a9618aa652 |
12 | 59b50bb6181b |
13 | 255585226748 |
14 | 10d8c16d95d5 |
15 | 779eb2459d8 |
hex | 3f07219e557 |
4331241334103 has 2 divisors, whose sum is σ = 4331241334104. Its totient is φ = 4331241334102.
The previous prime is 4331241334093. The next prime is 4331241334139. The reversal of 4331241334103 is 3014331421334.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4331241334103 - 214 = 4331241317719 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4331241334103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4331241334003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2165620667051 + 2165620667052.
It is an arithmetic number, because the mean of its divisors is an integer number (2165620667052).
Almost surely, 24331241334103 is an apocalyptic number.
4331241334103 is a deficient number, since it is larger than the sum of its proper divisors (1).
4331241334103 is an equidigital number, since it uses as much as digits as its factorization.
4331241334103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 4331241334103 its reverse (3014331421334), we get a palindrome (7345572755437).
The spelling of 4331241334103 in words is "four trillion, three hundred thirty-one billion, two hundred forty-one million, three hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •