Base | Representation |
---|---|
bin | 100100001111110… |
… | …1111101001000001 |
3 | 10010202122111002010 |
4 | 1020133233221001 |
5 | 4442331444103 |
6 | 320405043133 |
7 | 42066135123 |
oct | 11037575101 |
9 | 3122574063 |
10 | 1216281153 |
11 | 57461703a |
12 | 29b3b64a9 |
13 | 164ca4cb9 |
14 | b776b213 |
15 | 71ba4903 |
hex | 487efa41 |
1216281153 has 8 divisors (see below), whose sum is σ = 1652306688. Its totient is φ = 795554864.
The previous prime is 1216281149. The next prime is 1216281163. The reversal of 1216281153 is 3511826121.
1216281153 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
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 1216281153 - 22 = 1216281149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1216281153.
It is not an unprimeable number, because it can be changed into a prime (1216281103) 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, 3824625 + ... + 3824942.
It is an arithmetic number, because the mean of its divisors is an integer number (206538336).
Almost surely, 21216281153 is an apocalyptic number.
It is an amenable number.
1216281153 is a deficient number, since it is larger than the sum of its proper divisors (436025535).
1216281153 is an equidigital number, since it uses as much as digits as its factorization.
1216281153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7649623.
The product of its digits is 2880, while the sum is 30.
The square root of 1216281153 is about 34875.2226229454. Note that the first 3 decimals coincide. The cubic root of 1216281153 is about 1067.4429151155.
The spelling of 1216281153 in words is "one billion, two hundred sixteen million, two hundred eighty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •