Base | Representation |
---|---|
bin | 100010101100011… |
… | …0001001000111100 |
3 | 10000010111110022010 |
4 | 1011120301020330 |
5 | 4341003330021 |
6 | 311303051220 |
7 | 40563601500 |
oct | 10530611074 |
9 | 3003443263 |
10 | 1164120636 |
11 | 548130078 |
12 | 285a40b10 |
13 | 1572413a3 |
14 | b0870300 |
15 | 6c2ee976 |
hex | 4563123c |
1164120636 has 72 divisors (see below), whose sum is σ = 3165697920. Its totient is φ = 331980768.
The previous prime is 1164120619. The next prime is 1164120637. The reversal of 1164120636 is 6360214611.
It is a super-2 number, since 2×11641206362 = 2710353710322088992, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1164120637) 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 23 ways as a sum of consecutive naturals, for example, 376545 + ... + 379623.
Almost surely, 21164120636 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1164120636, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1582848960).
1164120636 is an abundant number, since it is smaller than the sum of its proper divisors (2001577284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1164120636 is a wasteful number, since it uses less digits than its factorization.
1164120636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3743 (or 3734 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 30.
The square root of 1164120636 is about 34119.2121245494. The cubic root of 1164120636 is about 1051.9602492365.
The spelling of 1164120636 in words is "one billion, one hundred sixty-four million, one hundred twenty thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •