Base | Representation |
---|---|
bin | 10010010000100001011010… |
… | …00011001101111110000001 |
3 | 12021011022110012120020212211 |
4 | 21020100231003031332001 |
5 | 20230304411141221002 |
6 | 221220412252422121 |
7 | 11312515104621163 |
oct | 1110205503157601 |
9 | 167138405506784 |
10 | 40150110101377 |
11 | 1187a625493aa1 |
12 | 460543a777941 |
13 | 19531a68b6463 |
14 | 9cb3c072a933 |
15 | 4995e32e8dd7 |
hex | 24842d0cdf81 |
40150110101377 has 2 divisors, whose sum is σ = 40150110101378. Its totient is φ = 40150110101376.
The previous prime is 40150110101303. The next prime is 40150110101401. The reversal of 40150110101377 is 77310101105104.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25943120846721 + 14206989254656 = 5093439^2 + 3769216^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40150110101377 is a prime.
It is a super-2 number, since 2×401501101013772 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40150110141377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20075055050688 + 20075055050689.
It is an arithmetic number, because the mean of its divisors is an integer number (20075055050689).
Almost surely, 240150110101377 is an apocalyptic number.
It is an amenable number.
40150110101377 is a deficient number, since it is larger than the sum of its proper divisors (1).
40150110101377 is an equidigital number, since it uses as much as digits as its factorization.
40150110101377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2940, while the sum is 31.
The spelling of 40150110101377 in words is "forty trillion, one hundred fifty billion, one hundred ten million, one hundred one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •