Base | Representation |
---|---|
bin | 10010011000110000110010… |
… | …00101100100000000001011 |
3 | 12022011101021020002102100212 |
4 | 21030120121011210000023 |
5 | 20244424240202410011 |
6 | 221554435253351335 |
7 | 11342130311641253 |
oct | 1114303105440013 |
9 | 168141236072325 |
10 | 40433243013131 |
11 | 11979707652241 |
12 | 465029733854b |
13 | 1973ab9119877 |
14 | 9dad9d6aa963 |
15 | 4a1b64cd708b |
hex | 24c61916400b |
40433243013131 has 4 divisors (see below), whose sum is σ = 40433285145912. Its totient is φ = 40433200880352.
The previous prime is 40433243013101. The next prime is 40433243013143. The reversal of 40433243013131 is 13131034233404.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40433243013131 - 218 = 40433242750987 is a prime.
It is a super-2 number, since 2×404332430131312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40433243013101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19592525 + ... + 21557678.
It is an arithmetic number, because the mean of its divisors is an integer number (10108321286478).
Almost surely, 240433243013131 is an apocalyptic number.
40433243013131 is a deficient number, since it is larger than the sum of its proper divisors (42132781).
40433243013131 is an equidigital number, since it uses as much as digits as its factorization.
40433243013131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42132780.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 40433243013131 its reverse (13131034233404), we get a palindrome (53564277246535).
The spelling of 40433243013131 in words is "forty trillion, four hundred thirty-three billion, two hundred forty-three million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •