Base | Representation |
---|---|
bin | 11001110010010… |
… | …10010101010101 |
3 | 120002000202002011 |
4 | 30321022111111 |
5 | 420333424000 |
6 | 33244144221 |
7 | 5234420452 |
oct | 1471122525 |
9 | 502022064 |
10 | 216311125 |
11 | 101113828 |
12 | 60538071 |
13 | 35a78664 |
14 | 20a2a829 |
15 | 13ecc2ba |
hex | ce4a555 |
216311125 has 16 divisors (see below), whose sum is σ = 270788544. Its totient is φ = 172515600.
The previous prime is 216311107. The next prime is 216311153. The reversal of 216311125 is 521113612.
It is a happy number.
216311125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 216311125 - 29 = 216310613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 216311096 and 216311105.
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, 40882 + ... + 45868.
It is an arithmetic number, because the mean of its divisors is an integer number (16924284).
Almost surely, 2216311125 is an apocalyptic number.
216311125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
216311125 is a deficient number, since it is larger than the sum of its proper divisors (54477419).
216311125 is an equidigital number, since it uses as much as digits as its factorization.
216311125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5349 (or 5339 counting only the distinct ones).
The product of its digits is 360, while the sum is 22.
The square root of 216311125 is about 14707.5193353604. The cubic root of 216311125 is about 600.2879404987.
Adding to 216311125 its reverse (521113612), we get a palindrome (737424737).
The spelling of 216311125 in words is "two hundred sixteen million, three hundred eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •