Base | Representation |
---|---|
bin | 100110110111011… |
… | …0000010010010000 |
3 | 10100212220020200021 |
4 | 1031232300102100 |
5 | 10132322231112 |
6 | 333223233224 |
7 | 44213453512 |
oct | 11556602220 |
9 | 3325806607 |
10 | 1304102032 |
11 | 60a14a182 |
12 | 3048a8814 |
13 | 17a24310c |
14 | c52abbb2 |
15 | 79750907 |
hex | 4dbb0490 |
1304102032 has 10 divisors (see below), whose sum is σ = 2526697718. Its totient is φ = 652051008.
The previous prime is 1304102027. The next prime is 1304102053. The reversal of 1304102032 is 2302014031.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1142710416 + 161391616 = 33804^2 + 12704^2 .
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 81506377 = 1304102032 / (1 + 3 + 0 + 4 + 1 + 0 + 2 + 0 + 3 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1304101997 and 1304102015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40753173 + ... + 40753204.
Almost surely, 21304102032 is an apocalyptic number.
It is an amenable number.
1304102032 is a deficient number, since it is larger than the sum of its proper divisors (1222595686).
1304102032 is an equidigital number, since it uses as much as digits as its factorization.
1304102032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81506385 (or 81506379 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 1304102032 is about 36112.3529003581. The cubic root of 1304102032 is about 1092.5396081691.
Adding to 1304102032 its reverse (2302014031), we get a palindrome (3606116063).
The spelling of 1304102032 in words is "one billion, three hundred four million, one hundred two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •