Base | Representation |
---|---|
bin | 10100111001111100… |
… | …01001000100110101 |
3 | 1001222011221100222111 |
4 | 22130332021010311 |
5 | 140441202023024 |
6 | 5053405531021 |
7 | 545061632005 |
oct | 123476110465 |
9 | 31864840874 |
10 | 11223470389 |
11 | 483a3a146a |
12 | 2212873a71 |
13 | 109b30b851 |
14 | 786842005 |
15 | 45a4d2a94 |
hex | 29cf89135 |
11223470389 has 2 divisors, whose sum is σ = 11223470390. Its totient is φ = 11223470388.
The previous prime is 11223470383. The next prime is 11223470473. The reversal of 11223470389 is 98307432211.
11223470389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9886324900 + 1337145489 = 99430^2 + 36567^2 .
It is a cyclic number.
It is not a de Polignac number, because 11223470389 - 211 = 11223468341 is a prime.
It is a super-2 number, since 2×112234703892 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11223470383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5611735194 + 5611735195.
It is an arithmetic number, because the mean of its divisors is an integer number (5611735195).
Almost surely, 211223470389 is an apocalyptic number.
It is an amenable number.
11223470389 is a deficient number, since it is larger than the sum of its proper divisors (1).
11223470389 is an equidigital number, since it uses as much as digits as its factorization.
11223470389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 40.
The spelling of 11223470389 in words is "eleven billion, two hundred twenty-three million, four hundred seventy thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •