Base | Representation |
---|---|
bin | 111111000010010… |
… | …0001011000111000 |
3 | 12110101221221201000 |
4 | 1332010201120320 |
5 | 13312432131202 |
6 | 545514125000 |
7 | 103262114505 |
oct | 17604413070 |
9 | 5411857630 |
10 | 2115114552 |
11 | 995a21961 |
12 | 4b0420760 |
13 | 279280695 |
14 | 160ca24ac |
15 | c5a5091c |
hex | 7e121638 |
2115114552 has 64 divisors (see below), whose sum is σ = 5887872000. Its totient is φ = 703531872.
The previous prime is 2115114511. The next prime is 2115114577. The reversal of 2115114552 is 2554115112.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93243 + ... + 113685.
It is an arithmetic number, because the mean of its divisors is an integer number (91998000).
Almost surely, 22115114552 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 2115114552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2943936000).
2115114552 is an abundant number, since it is smaller than the sum of its proper divisors (3772757448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2115114552 is a wasteful number, since it uses less digits than its factorization.
2115114552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20937 (or 20927 counting only the distinct ones).
The product of its digits is 2000, while the sum is 27.
The square root of 2115114552 is about 45990.3745581616. The cubic root of 2115114552 is about 1283.6441060979.
Adding to 2115114552 its reverse (2554115112), we get a palindrome (4669229664).
The spelling of 2115114552 in words is "two billion, one hundred fifteen million, one hundred fourteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •