Base | Representation |
---|---|
bin | 11000010011101010… |
… | …11100001011100101 |
3 | 1020200110200220110220 |
4 | 30021311130023211 |
5 | 203211233442033 |
6 | 5554532434553 |
7 | 641250240603 |
oct | 141165341345 |
9 | 36613626426 |
10 | 13049905893 |
11 | 55973714a2 |
12 | 2642478a59 |
13 | 12cc82630b |
14 | 8bb23a873 |
15 | 515a0dbb3 |
hex | 309d5c2e5 |
13049905893 has 8 divisors (see below), whose sum is σ = 17403523968. Its totient is φ = 8698112544.
The previous prime is 13049905879. The next prime is 13049905901. The reversal of 13049905893 is 39850994031.
It is a happy number.
13049905893 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13049905893 - 26 = 13049905829 is a prime.
It is a super-2 number, since 2×130499058932 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13049905873) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 439405 + ... + 468162.
It is an arithmetic number, because the mean of its divisors is an integer number (2175440496).
Almost surely, 213049905893 is an apocalyptic number.
It is an amenable number.
13049905893 is a deficient number, since it is larger than the sum of its proper divisors (4353618075).
13049905893 is an equidigital number, since it uses as much as digits as its factorization.
13049905893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912363.
The product of its (nonzero) digits is 1049760, while the sum is 51.
The spelling of 13049905893 in words is "thirteen billion, forty-nine million, nine hundred five thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •