Base | Representation |
---|---|
bin | 1011001011011111… |
… | …1111000000100100 |
3 | 21202010221122010122 |
4 | 2302313333000210 |
5 | 22121230123302 |
6 | 1213442141112 |
7 | 134240152523 |
oct | 26267770044 |
9 | 7663848118 |
10 | 3001020452 |
11 | 12aaaa80a1 |
12 | 6b9051798 |
13 | 38a980b61 |
14 | 2067d04ba |
15 | 1286e63a2 |
hex | b2dff024 |
3001020452 has 12 divisors (see below), whose sum is σ = 5252667420. Its totient is φ = 1500258336.
The previous prime is 3001020419. The next prime is 3001020481. The reversal of 3001020452 is 2540201003.
It can be written as a sum of positive squares in 2 ways, for example, as 840072256 + 2160948196 = 28984^2 + 46486^2 .
It is a super-2 number, since 2×30010204522 = 18012247506644568608, 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 3001020452.
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 3 ways as a sum of consecutive naturals, for example, 34763 + ... + 84914.
It is an arithmetic number, because the mean of its divisors is an integer number (437722285).
Almost surely, 23001020452 is an apocalyptic number.
It is an amenable number.
3001020452 is a deficient number, since it is larger than the sum of its proper divisors (2251646968).
3001020452 is a wasteful number, since it uses less digits than its factorization.
3001020452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125950 (or 125948 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 3001020452 is about 54781.5703681448. The cubic root of 3001020452 is about 1442.4130791539.
Adding to 3001020452 its reverse (2540201003), we get a palindrome (5541221455).
The spelling of 3001020452 in words is "three billion, one million, twenty thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •