Base | Representation |
---|---|
bin | 100110110100011… |
… | …0011000010001100 |
3 | 10100202221220120002 |
4 | 1031220303002030 |
5 | 10131422243203 |
6 | 333125543432 |
7 | 44164260650 |
oct | 11550630214 |
9 | 3322856502 |
10 | 1302540428 |
11 | 6092829a2 |
12 | 304274b78 |
13 | 179b173a7 |
14 | c4dc2a60 |
15 | 79542d88 |
hex | 4da3308c |
1302540428 has 24 divisors (see below), whose sum is σ = 2606027424. Its totient is φ = 558028800.
The previous prime is 1302540419. The next prime is 1302540431. The reversal of 1302540428 is 8240452031.
It is a happy number.
It is a super-2 number, since 2×13025404282 = 3393223133148846368, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1302540428.
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 in 7 ways as a sum of consecutive naturals, for example, 90188 + ... + 103628.
It is an arithmetic number, because the mean of its divisors is an integer number (108584476).
Almost surely, 21302540428 is an apocalyptic number.
It is an amenable number.
1302540428 is an abundant number, since it is smaller than the sum of its proper divisors (1303486996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302540428 is a wasteful number, since it uses less digits than its factorization.
1302540428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16913 (or 16911 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 29.
The square root of 1302540428 is about 36090.7249580831. The cubic root of 1302540428 is about 1092.1033448419.
Adding to 1302540428 its reverse (8240452031), we get a palindrome (9542992459).
The spelling of 1302540428 in words is "one billion, three hundred two million, five hundred forty thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •