Base | Representation |
---|---|
bin | 100100010000100… |
… | …1001101111111001 |
3 | 10010210100020100202 |
4 | 1020201021233321 |
5 | 4442430301413 |
6 | 320421011545 |
7 | 42102233141 |
oct | 11041115771 |
9 | 3123306322 |
10 | 1216650233 |
11 | 574849367 |
12 | 29b553bb5 |
13 | 1650a3ca6 |
14 | b7825921 |
15 | 71c28e58 |
hex | 48849bf9 |
1216650233 has 4 divisors (see below), whose sum is σ = 1217639808. Its totient is φ = 1215660660.
The previous prime is 1216650223. The next prime is 1216650301. The reversal of 1216650233 is 3320566121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3320566121 = 47 ⋅70650343.
It is a cyclic number.
It is not a de Polignac number, because 1216650233 - 216 = 1216584697 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1216650196 and 1216650205.
It is not an unprimeable number, because it can be changed into a prime (1216650223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 492941 + ... + 495402.
It is an arithmetic number, because the mean of its divisors is an integer number (304409952).
Almost surely, 21216650233 is an apocalyptic number.
It is an amenable number.
1216650233 is a deficient number, since it is larger than the sum of its proper divisors (989575).
1216650233 is an equidigital number, since it uses as much as digits as its factorization.
1216650233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 989574.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 1216650233 is about 34880.5136573417. The cubic root of 1216650233 is about 1067.5508758960.
The spelling of 1216650233 in words is "one billion, two hundred sixteen million, six hundred fifty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •