Base | Representation |
---|---|
bin | 11101101100001000100… |
… | …100000101100111101011 |
3 | 21020001020202020102002220 |
4 | 131230020210011213223 |
5 | 231411414301043111 |
6 | 4201140201325123 |
7 | 300255242402451 |
oct | 35541044054753 |
9 | 7201222212086 |
10 | 2040253143531 |
11 | 7172a278a359 |
12 | 28b4b87967a3 |
13 | 11a519bba0b5 |
14 | 70a6a9149d1 |
15 | 38111d19e06 |
hex | 1db089059eb |
2040253143531 has 8 divisors (see below), whose sum is σ = 2720574348240. Its totient is φ = 1360050350592.
The previous prime is 2040253143529. The next prime is 2040253143547. The reversal of 2040253143531 is 1353413520402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2040253143531 - 21 = 2040253143529 is a prime.
It is a super-2 number, since 2×20402531435312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2040253143492 and 2040253143501.
It is not an unprimeable number, because it can be changed into a prime (2040253143571) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29562730 + ... + 29631663.
It is an arithmetic number, because the mean of its divisors is an integer number (340071793530).
Almost surely, 22040253143531 is an apocalyptic number.
2040253143531 is a deficient number, since it is larger than the sum of its proper divisors (680321204709).
2040253143531 is a wasteful number, since it uses less digits than its factorization.
2040253143531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59205885.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 2040253143531 its reverse (1353413520402), we get a palindrome (3393666663933).
The spelling of 2040253143531 in words is "two trillion, forty billion, two hundred fifty-three million, one hundred forty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •