Base | Representation |
---|---|
bin | 11101001011101011011… |
… | …011010000010101101001 |
3 | 21002201022002110110111022 |
4 | 131023223123100111221 |
5 | 230324032031104010 |
6 | 4133134203142225 |
7 | 264612536266046 |
oct | 35135333202551 |
9 | 7081262413438 |
10 | 2005404550505 |
11 | 70353a651654 |
12 | 2847b1b14975 |
13 | 117155168855 |
14 | 6d0c257c1cd |
15 | 372726e5d55 |
hex | 1d2eb6d0569 |
2005404550505 has 4 divisors (see below), whose sum is σ = 2406485460612. Its totient is φ = 1604323640400.
The previous prime is 2005404550493. The next prime is 2005404550559. The reversal of 2005404550505 is 5050554045002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 698031843289 + 1307372707216 = 835483^2 + 1143404^2 .
It is not a de Polignac number, because 2005404550505 - 24 = 2005404550489 is a prime.
It is a super-2 number, since 2×20054045505052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 200540455046 + ... + 200540455055.
It is an arithmetic number, because the mean of its divisors is an integer number (601621365153).
Almost surely, 22005404550505 is an apocalyptic number.
It is an amenable number.
2005404550505 is a deficient number, since it is larger than the sum of its proper divisors (401080910107).
2005404550505 is an equidigital number, since it uses as much as digits as its factorization.
2005404550505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401080910106.
The product of its (nonzero) digits is 100000, while the sum is 35.
Adding to 2005404550505 its reverse (5050554045002), we get a palindrome (7055958595507).
The spelling of 2005404550505 in words is "two trillion, five billion, four hundred four million, five hundred fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •