Base | Representation |
---|---|
bin | 100001101000011011010… |
… | …101100001111010011101 |
3 | 22011221111002102002122221 |
4 | 201220123111201322131 |
5 | 300331214131042023 |
6 | 4525421135305341 |
7 | 325655322440563 |
oct | 41503325417235 |
9 | 8157432362587 |
10 | 2311151034013 |
11 | 811176563a78 |
12 | 313abb97b251 |
13 | 139c2c68c053 |
14 | 7dc08979a33 |
15 | 401b961185d |
hex | 21a1b561e9d |
2311151034013 has 2 divisors, whose sum is σ = 2311151034014. Its totient is φ = 2311151034012.
The previous prime is 2311151033981. The next prime is 2311151034043. The reversal of 2311151034013 is 3104301511132.
2311151034013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2279139741124 + 32011292889 = 1509682^2 + 178917^2 .
It is a cyclic number.
It is not a de Polignac number, because 2311151034013 - 25 = 2311151033981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2311151034043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1155575517006 + 1155575517007.
It is an arithmetic number, because the mean of its divisors is an integer number (1155575517007).
Almost surely, 22311151034013 is an apocalyptic number.
It is an amenable number.
2311151034013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2311151034013 is an equidigital number, since it uses as much as digits as its factorization.
2311151034013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 2311151034013 its reverse (3104301511132), we get a palindrome (5415452545145).
The spelling of 2311151034013 in words is "two trillion, three hundred eleven billion, one hundred fifty-one million, thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •