Base | Representation |
---|---|
bin | 10010001111101101100111… |
… | …01000000010101100101011 |
3 | 12021001122200021211202210021 |
4 | 21013312303220002230223 |
5 | 20224330434100133121 |
6 | 221155533120501311 |
7 | 11310512034356035 |
oct | 1107666350025453 |
9 | 167048607752707 |
10 | 40122303130411 |
11 | 11869856149157 |
12 | 45bbb7a17a837 |
13 | 1950694981a98 |
14 | 9c9d03666c55 |
15 | 498a16eb1641 |
hex | 247db3a02b2b |
40122303130411 has 2 divisors, whose sum is σ = 40122303130412. Its totient is φ = 40122303130410.
The previous prime is 40122303130331. The next prime is 40122303130417. The reversal of 40122303130411 is 11403130322104.
40122303130411 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 40122303130411 - 225 = 40122269575979 is a prime.
It is not a weakly prime, because it can be changed into another prime (40122303130417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20061151565205 + 20061151565206.
It is an arithmetic number, because the mean of its divisors is an integer number (20061151565206).
Almost surely, 240122303130411 is an apocalyptic number.
40122303130411 is a deficient number, since it is larger than the sum of its proper divisors (1).
40122303130411 is an equidigital number, since it uses as much as digits as its factorization.
40122303130411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 40122303130411 its reverse (11403130322104), we get a palindrome (51525433452515).
The spelling of 40122303130411 in words is "forty trillion, one hundred twenty-two billion, three hundred three million, one hundred thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •