Base | Representation |
---|---|
bin | 1011010011111100… |
… | …1100001110100100 |
3 | 21211121122100120222 |
4 | 2310333030032210 |
5 | 22204313322121 |
6 | 1221145543512 |
7 | 135150342554 |
oct | 26477141644 |
9 | 7747570528 |
10 | 3036464036 |
11 | 1319006411 |
12 | 708aa4b98 |
13 | 3951107a8 |
14 | 20b3b9164 |
15 | 12b8980ab |
hex | b4fcc3a4 |
3036464036 has 6 divisors (see below), whose sum is σ = 5313812070. Its totient is φ = 1518232016.
The previous prime is 3036464033. The next prime is 3036464047. The reversal of 3036464036 is 6304646303.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 2770969600 + 265494436 = 52640^2 + 16294^2 .
It is a super-2 number, since 2×30364640362 = 18440227683842818592, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3036463987 and 3036464005.
It is not an unprimeable number, because it can be changed into a prime (3036464033) by changing a digit.
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 as a sum of consecutive naturals, namely, 379558001 + ... + 379558008.
It is an arithmetic number, because the mean of its divisors is an integer number (885635345).
Almost surely, 23036464036 is an apocalyptic number.
It is an amenable number.
3036464036 is a deficient number, since it is larger than the sum of its proper divisors (2277348034).
3036464036 is a wasteful number, since it uses less digits than its factorization.
3036464036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759116013 (or 759116011 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 35.
The square root of 3036464036 is about 55104.1199548636. The cubic root of 3036464036 is about 1448.0694141963.
The spelling of 3036464036 in words is "three billion, thirty-six million, four hundred sixty-four thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •