Base | Representation |
---|---|
bin | 101011110100010000000… |
… | …011011001110010111011 |
3 | 101122212000122121121121112 |
4 | 223310100003121302323 |
5 | 343313103044331133 |
6 | 10223130415030535 |
7 | 430353261424433 |
oct | 53642003316273 |
9 | 11585018547545 |
10 | 3011041402043 |
11 | a60a80412534 |
12 | 40768780b44b |
13 | 18ac2b1c22ac |
14 | a5a414a32c3 |
15 | 534cdc60648 |
hex | 2bd100d9cbb |
3011041402043 has 2 divisors, whose sum is σ = 3011041402044. Its totient is φ = 3011041402042.
The previous prime is 3011041402037. The next prime is 3011041402049. The reversal of 3011041402043 is 3402041401103.
3011041402043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (3011041402037) and next prime (3011041402049).
It is an emirp because it is prime and its reverse (3402041401103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3011041402043 - 28 = 3011041401787 is a prime.
It is not a weakly prime, because it can be changed into another prime (3011041402049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1505520701021 + 1505520701022.
It is an arithmetic number, because the mean of its divisors is an integer number (1505520701022).
Almost surely, 23011041402043 is an apocalyptic number.
3011041402043 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011041402043 is an equidigital number, since it uses as much as digits as its factorization.
3011041402043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 3011041402043 its reverse (3402041401103), we get a palindrome (6413082803146).
The spelling of 3011041402043 in words is "three trillion, eleven billion, forty-one million, four hundred two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •