Base | Representation |
---|---|
bin | 11101000111001000100… |
… | …001100110100000101011 |
3 | 21002020200221221001122101 |
4 | 131013020201212200223 |
5 | 230234033123404311 |
6 | 4131010021034231 |
7 | 264350564544061 |
oct | 35071041464053 |
9 | 7066627831571 |
10 | 2000524044331 |
11 | 70146574007a |
12 | 28386b555977 |
13 | 116857cb7687 |
14 | 6cb7c304031 |
15 | 37088ee4ec1 |
hex | 1d1c886682b |
2000524044331 has 2 divisors, whose sum is σ = 2000524044332. Its totient is φ = 2000524044330.
The previous prime is 2000524044313. The next prime is 2000524044397. The reversal of 2000524044331 is 1334404250002.
It is a happy number.
Together with previous prime (2000524044313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2000524044331 - 219 = 2000523520043 is a prime.
It is a super-2 number, since 2×20005240443312 (a number of 25 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 2000524044331.
It is not a weakly prime, because it can be changed into another prime (2000524041331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000262022165 + 1000262022166.
It is an arithmetic number, because the mean of its divisors is an integer number (1000262022166).
Almost surely, 22000524044331 is an apocalyptic number.
2000524044331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000524044331 is an equidigital number, since it uses as much as digits as its factorization.
2000524044331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 28.
Adding to 2000524044331 its reverse (1334404250002), we get a palindrome (3334928294333).
The spelling of 2000524044331 in words is "two trillion, five hundred twenty-four million, forty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •