Base | Representation |
---|---|
bin | 11001101011101… |
… | …10111010100000 |
3 | 120000101202012002 |
4 | 30311312322200 |
5 | 420123221102 |
6 | 33213423132 |
7 | 5224152656 |
oct | 1465667240 |
9 | 500352162 |
10 | 215445152 |
11 | 10068214a |
12 | 6019aaa8 |
13 | 35834450 |
14 | 20882dd6 |
15 | 13daa902 |
hex | cd76ea0 |
215445152 has 48 divisors (see below), whose sum is σ = 458089632. Its totient is φ = 99152640.
The previous prime is 215445127. The next prime is 215445157. The reversal of 215445152 is 251544512.
It is a super-2 number, since 2×2154451522 = 92833227040606208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (215445157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 237083 + ... + 237989.
It is an arithmetic number, because the mean of its divisors is an integer number (9543534).
Almost surely, 2215445152 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 215445152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (229044816).
215445152 is an abundant number, since it is smaller than the sum of its proper divisors (242644480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215445152 is a wasteful number, since it uses less digits than its factorization.
215445152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501 (or 1493 counting only the distinct ones).
The product of its digits is 8000, while the sum is 29.
The square root of 215445152 is about 14678.0500067277. The cubic root of 215445152 is about 599.4858113277.
Adding to 215445152 its reverse (251544512), we get a palindrome (466989664).
The spelling of 215445152 in words is "two hundred fifteen million, four hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •