Base | Representation |
---|---|
bin | 100110101110001… |
… | …0100100111111100 |
3 | 10100112210202120022 |
4 | 1031130110213330 |
5 | 10130103121030 |
6 | 332531511312 |
7 | 44124420410 |
oct | 11534244774 |
9 | 3315722508 |
10 | 1299270140 |
11 | 607449983 |
12 | 303158538 |
13 | 1792409cc |
14 | c47b0d40 |
15 | 790e8de5 |
hex | 4d7149fc |
1299270140 has 48 divisors (see below), whose sum is σ = 3218847744. Its totient is φ = 431092800.
The previous prime is 1299270079. The next prime is 1299270157. The reversal of 1299270140 is 410729921.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 1299270140.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 145346 + ... + 154025.
It is an arithmetic number, because the mean of its divisors is an integer number (67059328).
Almost surely, 21299270140 is an apocalyptic number.
1299270140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1299270140 is an abundant number, since it is smaller than the sum of its proper divisors (1919577604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1299270140 is a wasteful number, since it uses less digits than its factorization.
1299270140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299418 (or 299416 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 35.
The square root of 1299270140 is about 36045.3899965030. The cubic root of 1299270140 is about 1091.1885976437.
The spelling of 1299270140 in words is "one billion, two hundred ninety-nine million, two hundred seventy thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •