Base | Representation |
---|---|
bin | 100010010111010… |
… | …0110010000110100 |
3 | 2222100200211020111 |
4 | 1010232212100310 |
5 | 4330141103121 |
6 | 310230112404 |
7 | 40400620363 |
oct | 10456462064 |
9 | 2870624214 |
10 | 1153066036 |
11 | 54196a641 |
12 | 2821ab704 |
13 | 154b707c5 |
14 | ad1d37da |
15 | 6b3692e1 |
hex | 44ba6434 |
1153066036 has 12 divisors (see below), whose sum is σ = 2018126628. Its totient is φ = 576458432.
The previous prime is 1153066009. The next prime is 1153066043. The reversal of 1153066036 is 6306603511.
It can be written as a sum of positive squares in 2 ways, for example, as 829785636 + 323280400 = 28806^2 + 17980^2 .
It is a super-2 number, since 2×11530660362 = 2659122566753506592, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1153065989 and 1153066007.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 30570 + ... + 56926.
It is an arithmetic number, because the mean of its divisors is an integer number (168177219).
Almost surely, 21153066036 is an apocalyptic number.
It is an amenable number.
1153066036 is a deficient number, since it is larger than the sum of its proper divisors (865060592).
1153066036 is a wasteful number, since it uses less digits than its factorization.
1153066036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37298 (or 37296 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 1153066036 is about 33956.8260589826. The cubic root of 1153066036 is about 1048.6198150146.
Adding to 1153066036 its reverse (6306603511), we get a palindrome (7459669547).
The spelling of 1153066036 in words is "one billion, one hundred fifty-three million, sixty-six thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •