Base | Representation |
---|---|
bin | 1000100111001011… |
… | …0010000000111100 |
3 | 12222010001010121000 |
4 | 2021302302000330 |
5 | 14213304300102 |
6 | 1021221410300 |
7 | 111200616303 |
oct | 21162620074 |
9 | 5863033530 |
10 | 2311790652 |
11 | a86a44596 |
12 | 546269990 |
13 | 2aac42a82 |
14 | 17d05b43a |
15 | d7e5001c |
hex | 89cb203c |
2311790652 has 96 divisors (see below), whose sum is σ = 6236733440. Its totient is φ = 739730880.
The previous prime is 2311790641. The next prime is 2311790659. The reversal of 2311790652 is 2560971132.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2311790659) 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 31 ways as a sum of consecutive naturals, for example, 422478 + ... + 427914.
Almost surely, 22311790652 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 2311790652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3118366720).
2311790652 is an abundant number, since it is smaller than the sum of its proper divisors (3924942788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2311790652 is a wasteful number, since it uses less digits than its factorization.
2311790652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5608 (or 5600 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 2311790652 is about 48081.0841391914. The cubic root of 2311790652 is about 1322.2578918179.
The spelling of 2311790652 in words is "two billion, three hundred eleven million, seven hundred ninety thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •