Base | Representation |
---|---|
bin | 101100011100101… |
… | …0100011010110100 |
3 | 10211221101000210100 |
4 | 1120321110122310 |
5 | 11023300431402 |
6 | 403554154100 |
7 | 51646603515 |
oct | 13071243264 |
9 | 3757330710 |
10 | 1491420852 |
11 | 6a5960619 |
12 | 357582930 |
13 | 1a9caa35c |
14 | 10210ca0c |
15 | 8ae0271c |
hex | 58e546b4 |
1491420852 has 72 divisors (see below), whose sum is σ = 3812320512. Its totient is φ = 491587200.
The previous prime is 1491420811. The next prime is 1491420857. The reversal of 1491420852 is 2580241941.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1491420857) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2456733 + ... + 2457339.
It is an arithmetic number, because the mean of its divisors is an integer number (52948896).
Almost surely, 21491420852 is an apocalyptic number.
1491420852 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1491420852 is an abundant number, since it is smaller than the sum of its proper divisors (2320899660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1491420852 is a wasteful number, since it uses less digits than its factorization.
1491420852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1269 (or 1264 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 1491420852 is about 38618.9183173221. The cubic root of 1491420852 is about 1142.5276968836.
The spelling of 1491420852 in words is "one billion, four hundred ninety-one million, four hundred twenty thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •