Base | Representation |
---|---|
bin | 111101001000100000111… |
… | …110101010101110011011 |
3 | 112212121121002120120201122 |
4 | 331020200332222232123 |
5 | 1022312203004024311 |
6 | 12533532132435455 |
7 | 612341320662335 |
oct | 75104076525633 |
9 | 15777532516648 |
10 | 4201031314331 |
11 | 137a713724565 |
12 | 57a230a78b8b |
13 | 24620399a077 |
14 | 10748c3a0455 |
15 | 74429c490db |
hex | 3d220faab9b |
4201031314331 has 2 divisors, whose sum is σ = 4201031314332. Its totient is φ = 4201031314330.
The previous prime is 4201031314303. The next prime is 4201031314351. The reversal of 4201031314331 is 1334131301024.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4201031314331 is a prime.
It is a super-2 number, since 2×42010313143312 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4201031314331.
It is not a weakly prime, because it can be changed into another prime (4201031314351) 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, 2100515657165 + 2100515657166.
It is an arithmetic number, because the mean of its divisors is an integer number (2100515657166).
Almost surely, 24201031314331 is an apocalyptic number.
4201031314331 is a deficient number, since it is larger than the sum of its proper divisors (1).
4201031314331 is an equidigital number, since it uses as much as digits as its factorization.
4201031314331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 4201031314331 its reverse (1334131301024), we get a palindrome (5535162615355).
The spelling of 4201031314331 in words is "four trillion, two hundred one billion, thirty-one million, three hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •