Base | Representation |
---|---|
bin | 11101000111001110100… |
… | …001001110101101010011 |
3 | 21002020221222011022222122 |
4 | 131013032201032231103 |
5 | 230234234400011011 |
6 | 4131024012324455 |
7 | 264353225413610 |
oct | 35071641165523 |
9 | 7066858138878 |
10 | 2000624610131 |
11 | 701507488704 |
12 | 28389917372b |
13 | 116872a98874 |
14 | 6cb8b801507 |
15 | 37092c5c3db |
hex | 1d1ce84eb53 |
2000624610131 has 4 divisors (see below), whose sum is σ = 2286428125872. Its totient is φ = 1714821094392.
The previous prime is 2000624610119. The next prime is 2000624610151. The reversal of 2000624610131 is 1310164260002.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2000624610131 - 230 = 1999550868307 is a prime.
It is a super-2 number, since 2×20006246101312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2000624610131.
It is not an unprimeable number, because it can be changed into a prime (2000624610151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 142901757860 + ... + 142901757873.
It is an arithmetic number, because the mean of its divisors is an integer number (571607031468).
Almost surely, 22000624610131 is an apocalyptic number.
2000624610131 is a deficient number, since it is larger than the sum of its proper divisors (285803515741).
2000624610131 is an equidigital number, since it uses as much as digits as its factorization.
2000624610131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285803515740.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 2000624610131 its reverse (1310164260002), we get a palindrome (3310788870133).
The spelling of 2000624610131 in words is "two trillion, six hundred twenty-four million, six hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •