Base | Representation |
---|---|
bin | 101000001110101… |
… | …1100111010111001 |
3 | 10111002001220211000 |
4 | 1100131130322321 |
5 | 10231033213123 |
6 | 341540555213 |
7 | 45310641300 |
oct | 12035347271 |
9 | 3432056730 |
10 | 1349897913 |
11 | 632a89311 |
12 | 3180b2b09 |
13 | 186888a80 |
14 | cb3cd437 |
15 | 7d799b43 |
hex | 5075ceb9 |
1349897913 has 48 divisors (see below), whose sum is σ = 2505336960. Its totient is φ = 712024992.
The previous prime is 1349897911. The next prime is 1349897933. The reversal of 1349897913 is 3197989431.
It is a happy number.
It is not a de Polignac number, because 1349897913 - 21 = 1349897911 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1349897913.
It is not an unprimeable number, because it can be changed into a prime (1349897911) 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 47 ways as a sum of consecutive naturals, for example, 22045 + ... + 56442.
It is an arithmetic number, because the mean of its divisors is an integer number (52194520).
Almost surely, 21349897913 is an apocalyptic number.
1349897913 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1349897913 is a deficient number, since it is larger than the sum of its proper divisors (1155439047).
1349897913 is a wasteful number, since it uses less digits than its factorization.
1349897913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78523 (or 78510 counting only the distinct ones).
The product of its digits is 1469664, while the sum is 54.
The square root of 1349897913 is about 36740.9568873757. The cubic root of 1349897913 is about 1105.1815902437.
The spelling of 1349897913 in words is "one billion, three hundred forty-nine million, eight hundred ninety-seven thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •