Base | Representation |
---|---|
bin | 11001101010001… |
… | …10111110000000 |
3 | 120000000202210121 |
4 | 30311012332000 |
5 | 420100430033 |
6 | 33205310024 |
7 | 5222404300 |
oct | 1465067600 |
9 | 500022717 |
10 | 215248768 |
11 | 100558649 |
12 | 60105314 |
13 | 35795c47 |
14 | 20831600 |
15 | 13d6c62d |
hex | cd46f80 |
215248768 has 48 divisors (see below), whose sum is σ = 498841200. Its totient is φ = 92246784.
The previous prime is 215248763. The next prime is 215248769. The reversal of 215248768 is 867842512.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (215248763) 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 5 ways as a sum of consecutive naturals, for example, 10888 + ... + 23431.
It is an arithmetic number, because the mean of its divisors is an integer number (10392525).
Almost surely, 2215248768 is an apocalyptic number.
215248768 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
215248768 is an abundant number, since it is smaller than the sum of its proper divisors (283592432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215248768 is an equidigital number, since it uses as much as digits as its factorization.
215248768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34347 (or 34328 counting only the distinct ones).
The product of its digits is 215040, while the sum is 43.
The square root of 215248768 is about 14671.3587646135. The cubic root of 215248768 is about 599.3036068552.
It can be divided in two parts, 21 and 5248768, that multiplied together give a triangular number (110224128 = T14847).
The spelling of 215248768 in words is "two hundred fifteen million, two hundred forty-eight thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •