Base | Representation |
---|---|
bin | 100001001111001… |
… | …0001000000001011 |
3 | 2212201111120020221 |
4 | 1002132101000023 |
5 | 4240444331334 |
6 | 302355130511 |
7 | 36431205025 |
oct | 10236210013 |
9 | 2781446227 |
10 | 1115230219 |
11 | 522577a74 |
12 | 2715a3a37 |
13 | 14a08404c |
14 | a8185015 |
15 | 67d938b4 |
hex | 4279100b |
1115230219 has 2 divisors, whose sum is σ = 1115230220. Its totient is φ = 1115230218.
The previous prime is 1115230201. The next prime is 1115230231. The reversal of 1115230219 is 9120325111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1115230219 - 219 = 1114705931 is a prime.
It is a super-2 number, since 2×11152302192 = 2487476882741575922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1115230193 and 1115230202.
It is not a weakly prime, because it can be changed into another prime (1115233219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557615109 + 557615110.
It is an arithmetic number, because the mean of its divisors is an integer number (557615110).
Almost surely, 21115230219 is an apocalyptic number.
1115230219 is a deficient number, since it is larger than the sum of its proper divisors (1).
1115230219 is an equidigital number, since it uses as much as digits as its factorization.
1115230219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 25.
The square root of 1115230219 is about 33395.0627937724. The cubic root of 1115230219 is about 1037.0224928764.
The spelling of 1115230219 in words is "one billion, one hundred fifteen million, two hundred thirty thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •