Base | Representation |
---|---|
bin | 111010001111001011001… |
… | …110100011000001101111 |
3 | 112011120220221110201021001 |
4 | 322033023032203001233 |
5 | 1011032121140002121 |
6 | 12302300550221131 |
7 | 562064613631426 |
oct | 72171316430157 |
9 | 15146827421231 |
10 | 4002024140911 |
11 | 13032813276a5 |
12 | 5477519547a7 |
13 | 23050a275c54 |
14 | db9b00c02bd |
15 | 6e17da3a991 |
hex | 3a3cb3a306f |
4002024140911 has 2 divisors, whose sum is σ = 4002024140912. Its totient is φ = 4002024140910.
The previous prime is 4002024140887. The next prime is 4002024140957. The reversal of 4002024140911 is 1190414202004.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4002024140911 - 27 = 4002024140783 is a prime.
It is a super-3 number, since 3×40020241409113 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4002024140911.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4002024140981) 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, 2001012070455 + 2001012070456.
It is an arithmetic number, because the mean of its divisors is an integer number (2001012070456).
Almost surely, 24002024140911 is an apocalyptic number.
4002024140911 is a deficient number, since it is larger than the sum of its proper divisors (1).
4002024140911 is an equidigital number, since it uses as much as digits as its factorization.
4002024140911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 4002024140911 its reverse (1190414202004), we get a palindrome (5192438342915).
The spelling of 4002024140911 in words is "four trillion, two billion, twenty-four million, one hundred forty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •