Base | Representation |
---|---|
bin | 11000010011110100… |
… | …01100000001000101 |
3 | 1020200120001010121221 |
4 | 30021322030001011 |
5 | 203212043303110 |
6 | 5555015240341 |
7 | 641263643116 |
oct | 141172140105 |
9 | 36616033557 |
10 | 13051150405 |
11 | 5598041517 |
12 | 26429790b1 |
13 | 12ccb70907 |
14 | 8bb48220d |
15 | 515ba77da |
hex | 309e8c045 |
13051150405 has 8 divisors (see below), whose sum is σ = 15667057152. Its totient is φ = 10437135888.
The previous prime is 13051150351. The next prime is 13051150417. The reversal of 13051150405 is 50405115031.
It is a happy number.
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 13051150405 - 219 = 13050626117 is a prime.
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 13051150405.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 457837 + ... + 485506.
It is an arithmetic number, because the mean of its divisors is an integer number (1958382144).
Almost surely, 213051150405 is an apocalyptic number.
It is an amenable number.
13051150405 is a deficient number, since it is larger than the sum of its proper divisors (2615906747).
13051150405 is an equidigital number, since it uses as much as digits as its factorization.
13051150405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946115.
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 13051150405 its reverse (50405115031), we get a palindrome (63456265436).
The spelling of 13051150405 in words is "thirteen billion, fifty-one million, one hundred fifty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •