Base | Representation |
---|---|
bin | 1010010001110… |
… | …1001100110011 |
3 | 10000010021110211 |
4 | 2210131030303 |
5 | 42014024334 |
6 | 4140004551 |
7 | 1032303454 |
oct | 244351463 |
9 | 100107424 |
10 | 43111219 |
11 | 22376108 |
12 | 12530757 |
13 | 8c159c8 |
14 | 5a2312b |
15 | 3bb8a64 |
hex | 291d333 |
43111219 has 2 divisors, whose sum is σ = 43111220. Its totient is φ = 43111218.
The previous prime is 43111193. The next prime is 43111231. The reversal of 43111219 is 91211134.
43111219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 43111219 - 221 = 41014067 is a prime.
It is a super-2 number, since 2×431112192 = 3717154407331922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 43111219.
It is not a weakly prime, because it can be changed into another prime (43111249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21555609 + 21555610.
It is an arithmetic number, because the mean of its divisors is an integer number (21555610).
Almost surely, 243111219 is an apocalyptic number.
43111219 is a deficient number, since it is larger than the sum of its proper divisors (1).
43111219 is an equidigital number, since it uses as much as digits as its factorization.
43111219 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 216, while the sum is 22.
The square root of 43111219 is about 6565.9134170350. The cubic root of 43111219 is about 350.6415959409.
It can be divided in two parts, 431112 and 19, that multiplied together give a triangular number (8191128 = T4047).
The spelling of 43111219 in words is "forty-three million, one hundred eleven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •