Base | Representation |
---|---|
bin | 101100011010111… |
… | …0110001010001000 |
3 | 10211212122202222120 |
4 | 1120311312022020 |
5 | 11023032313342 |
6 | 403522451240 |
7 | 51636062403 |
oct | 13065661210 |
9 | 3755582876 |
10 | 1490510472 |
11 | 6a5399640 |
12 | 357203b20 |
13 | 1a9a4bb79 |
14 | 101d52d3a |
15 | 8acc2aec |
hex | 58d76288 |
1490510472 has 64 divisors (see below), whose sum is σ = 4102401600. Its totient is φ = 447517440.
The previous prime is 1490510453. The next prime is 1490510503. The reversal of 1490510472 is 2740150941.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2878 + ... + 54674.
It is an arithmetic number, because the mean of its divisors is an integer number (64100025).
Almost surely, 21490510472 is an apocalyptic number.
1490510472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1490510472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2051200800).
1490510472 is an abundant number, since it is smaller than the sum of its proper divisors (2611891128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1490510472 is a wasteful number, since it uses less digits than its factorization.
1490510472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51926 (or 51922 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
The square root of 1490510472 is about 38607.1298078477. The cubic root of 1490510472 is about 1142.2951789971.
The spelling of 1490510472 in words is "one billion, four hundred ninety million, five hundred ten thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •