Base | Representation |
---|---|
bin | 11101001011110001001… |
… | …100110010011111011011 |
3 | 21002201112211202000120002 |
4 | 131023301030302133123 |
5 | 230324231330442111 |
6 | 4133151543323215 |
7 | 264615123546626 |
oct | 35136114623733 |
9 | 7081484660502 |
10 | 2005501421531 |
11 | 70358a2a6253 |
12 | 28481a45050b |
13 | 11716c25509a |
14 | 6d0d1396dbd |
15 | 3727ae7d63b |
hex | 1d2f13327db |
2005501421531 has 8 divisors (see below), whose sum is σ = 2018697748704. Its totient is φ = 1992328349760.
The previous prime is 2005501421527. The next prime is 2005501421537. The reversal of 2005501421531 is 1351241055002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2005501421531 - 22 = 2005501421527 is a prime.
It is a super-2 number, since 2×20055014215312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2005501421494 and 2005501421503.
It is not an unprimeable number, because it can be changed into a prime (2005501421537) 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, 5640791 + ... + 5985776.
It is an arithmetic number, because the mean of its divisors is an integer number (252337218588).
Almost surely, 22005501421531 is an apocalyptic number.
2005501421531 is a deficient number, since it is larger than the sum of its proper divisors (13196327173).
2005501421531 is a wasteful number, since it uses less digits than its factorization.
2005501421531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11627701.
The product of its (nonzero) digits is 6000, while the sum is 29.
Adding to 2005501421531 its reverse (1351241055002), we get a palindrome (3356742476533).
The spelling of 2005501421531 in words is "two trillion, five billion, five hundred one million, four hundred twenty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •