Base | Representation |
---|---|
bin | 100100001111111… |
… | …0100010011000111 |
3 | 10010202200110020201 |
4 | 1020133310103013 |
5 | 4442333101411 |
6 | 320405311331 |
7 | 42066244546 |
oct | 11037642307 |
9 | 3122613221 |
10 | 1216300231 |
11 | 57462a403 |
12 | 29b405547 |
13 | 164cb08a3 |
14 | b777415d |
15 | 71baa3c1 |
hex | 487f44c7 |
1216300231 has 8 divisors (see below), whose sum is σ = 1234833264. Its totient is φ = 1197817920.
The previous prime is 1216300199. The next prime is 1216300313. The reversal of 1216300231 is 1320036121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1216300231 - 25 = 1216300199 is a prime.
It is a super-2 number, since 2×12163002312 = 2958772503861306722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1216300199 and 1216300208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1216300831) 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, 37116 + ... + 61726.
It is an arithmetic number, because the mean of its divisors is an integer number (154354158).
Almost surely, 21216300231 is an apocalyptic number.
1216300231 is a deficient number, since it is larger than the sum of its proper divisors (18533033).
1216300231 is an equidigital number, since it uses as much as digits as its factorization.
1216300231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25361.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 1216300231 is about 34875.4961398401. The cubic root of 1216300231 is about 1067.4484962180.
Adding to 1216300231 its reverse (1320036121), we get a palindrome (2536336352).
The spelling of 1216300231 in words is "one billion, two hundred sixteen million, three hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •