Base | Representation |
---|---|
bin | 10011100110110010011110… |
… | …10011011110100011110111 |
3 | 12122122200022120122101010012 |
4 | 21303121033103132203313 |
5 | 21122340401312120343 |
6 | 231410221244050435 |
7 | 12036620241141341 |
oct | 1163311723364367 |
9 | 178580276571105 |
10 | 43114212223223 |
11 | 128126a88a6579 |
12 | 4a039a6533a1b |
13 | 1b0986418ca2b |
14 | a90a4bb90291 |
15 | 4eb77624e718 |
hex | 27364f4de8f7 |
43114212223223 has 2 divisors, whose sum is σ = 43114212223224. Its totient is φ = 43114212223222.
The previous prime is 43114212223169. The next prime is 43114212223231. The reversal of 43114212223223 is 32232221241134.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 43114212223223 - 210 = 43114212222199 is a prime.
It is a super-2 number, since 2×431142122232232 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 43114212223223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43114212223273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21557106111611 + 21557106111612.
It is an arithmetic number, because the mean of its divisors is an integer number (21557106111612).
Almost surely, 243114212223223 is an apocalyptic number.
43114212223223 is a deficient number, since it is larger than the sum of its proper divisors (1).
43114212223223 is an equidigital number, since it uses as much as digits as its factorization.
43114212223223 is an evil number, because the sum of its binary digits is even.
The product of its digits is 27648, while the sum is 32.
Adding to 43114212223223 its reverse (32232221241134), we get a palindrome (75346433464357).
The spelling of 43114212223223 in words is "forty-three trillion, one hundred fourteen billion, two hundred twelve million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •