Base | Representation |
---|---|
bin | 111010101010010111000… |
… | …001101000010011000101 |
3 | 112021101021011200000000122 |
4 | 322222113001220103011 |
5 | 1012021411024013334 |
6 | 12323525211151325 |
7 | 564150135033146 |
oct | 72522701502305 |
9 | 15241234600018 |
10 | 4031213110469 |
11 | 131469a786536 |
12 | 551339145545 |
13 | 2331ac5c557c |
14 | dd17c92bacd |
15 | 6ecdb35e32e |
hex | 3aa970684c5 |
4031213110469 has 2 divisors, whose sum is σ = 4031213110470. Its totient is φ = 4031213110468.
The previous prime is 4031213110411. The next prime is 4031213110487. The reversal of 4031213110469 is 9640113121304.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3839005398244 + 192207712225 = 1959338^2 + 438415^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4031213110469 is a prime.
It is a super-2 number, since 2×40312131104692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4031213110489) 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, 2015606555234 + 2015606555235.
It is an arithmetic number, because the mean of its divisors is an integer number (2015606555235).
Almost surely, 24031213110469 is an apocalyptic number.
It is an amenable number.
4031213110469 is a deficient number, since it is larger than the sum of its proper divisors (1).
4031213110469 is an equidigital number, since it uses as much as digits as its factorization.
4031213110469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 35.
The spelling of 4031213110469 in words is "four trillion, thirty-one billion, two hundred thirteen million, one hundred ten thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •