Base | Representation |
---|---|
bin | 1011100011111000… |
… | …0000110100000010 |
3 | 22000021100010220210 |
4 | 2320332000310002 |
5 | 22323413422002 |
6 | 1231533414550 |
7 | 136621210626 |
oct | 27076006402 |
9 | 8007303823 |
10 | 3103264002 |
11 | 13527911a3 |
12 | 72733a456 |
13 | 3a5bcb8b7 |
14 | 216207186 |
15 | 13269096c |
hex | b8f80d02 |
3103264002 has 16 divisors (see below), whose sum is σ = 6221345760. Its totient is φ = 1031951712.
The previous prime is 3103264001. The next prime is 3103264039. The reversal of 3103264002 is 2004623013.
It is a happy number.
It is a super-2 number, since 2×31032640022 = 19260494932218112008, 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 3103264002.
It is not an unprimeable number, because it can be changed into a prime (3103264001) by changing a digit.
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, 614683 + ... + 619710.
It is an arithmetic number, because the mean of its divisors is an integer number (388834110).
Almost surely, 23103264002 is an apocalyptic number.
3103264002 is an abundant number, since it is smaller than the sum of its proper divisors (3118081758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3103264002 is a wasteful number, since it uses less digits than its factorization.
3103264002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1234817.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 3103264002 is about 55706.9475200356. The cubic root of 3103264002 is about 1458.6113026105.
Adding to 3103264002 its reverse (2004623013), we get a palindrome (5107887015).
The spelling of 3103264002 in words is "three billion, one hundred three million, two hundred sixty-four thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •