Base | Representation |
---|---|
bin | 100100001111100… |
… | …1011100000100000 |
3 | 10010202100222001121 |
4 | 1020133023200200 |
5 | 4442312230102 |
6 | 320401542024 |
7 | 42064650463 |
oct | 11037134040 |
9 | 3122328047 |
10 | 1216133152 |
11 | 574525923 |
12 | 29b344914 |
13 | 164c52820 |
14 | b772d2da |
15 | 71b75b37 |
hex | 487cb820 |
1216133152 has 96 divisors (see below), whose sum is σ = 2729401920. Its totient is φ = 528768000.
The previous prime is 1216133143. The next prime is 1216133153. The reversal of 1216133152 is 2513316121.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (1216133153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1983598 + ... + 1984210.
It is an arithmetic number, because the mean of its divisors is an integer number (28431270).
Almost surely, 21216133152 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 1216133152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1364700960).
1216133152 is an abundant number, since it is smaller than the sum of its proper divisors (1513268768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1216133152 is a wasteful number, since it uses less digits than its factorization.
1216133152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 906 (or 898 counting only the distinct ones).
The product of its digits is 1080, while the sum is 25.
The square root of 1216133152 is about 34873.1006938012. The cubic root of 1216133152 is about 1067.3996167309.
Adding to 1216133152 its reverse (2513316121), we get a palindrome (3729449273).
The spelling of 1216133152 in words is "one billion, two hundred sixteen million, one hundred thirty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •