Base | Representation |
---|---|
bin | 11101001011110001001… |
… | …100110010011111110001 |
3 | 21002201112211202000120220 |
4 | 131023301030302133301 |
5 | 230324231330442203 |
6 | 4133151543323253 |
7 | 264615123546660 |
oct | 35136114623761 |
9 | 7081484660526 |
10 | 2005501421553 |
11 | 70358a2a6273 |
12 | 28481a450529 |
13 | 11716c2550b6 |
14 | 6d0d1396dd7 |
15 | 3727ae7d653 |
hex | 1d2f13327f1 |
2005501421553 has 8 divisors (see below), whose sum is σ = 3056002166208. Its totient is φ = 1146000812304.
The previous prime is 2005501421537. The next prime is 2005501421591. The reversal of 2005501421553 is 3551241055002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2005501421553 - 24 = 2005501421537 is a prime.
It is a super-2 number, since 2×20055014215532 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2005501421513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47750033826 + ... + 47750033867.
It is an arithmetic number, because the mean of its divisors is an integer number (382000270776).
Almost surely, 22005501421553 is an apocalyptic number.
It is an amenable number.
2005501421553 is a deficient number, since it is larger than the sum of its proper divisors (1050500744655).
2005501421553 is an equidigital number, since it uses as much as digits as its factorization.
2005501421553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95500067703.
The product of its (nonzero) digits is 30000, while the sum is 33.
Adding to 2005501421553 its reverse (3551241055002), we get a palindrome (5556742476555).
The spelling of 2005501421553 in words is "two trillion, five billion, five hundred one million, four hundred twenty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •