Base | Representation |
---|---|
bin | 10010010100111000110011… |
… | …11001000101101110000001 |
3 | 12021200122122010121101020101 |
4 | 21022130121321011232001 |
5 | 20240234112302100101 |
6 | 221413341025242401 |
7 | 11326405233354616 |
oct | 1112343171055601 |
9 | 167618563541211 |
10 | 40300112534401 |
11 | 119281aa9a4105 |
12 | 462a522193401 |
13 | 1964390808175 |
14 | 9d477055250d |
15 | 49d472209401 |
hex | 24a719e45b81 |
40300112534401 has 2 divisors, whose sum is σ = 40300112534402. Its totient is φ = 40300112534400.
The previous prime is 40300112534387. The next prime is 40300112534447. The reversal of 40300112534401 is 10443521100304.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38807903700801 + 1492208833600 = 6229599^2 + 1221560^2 .
It is a cyclic number.
It is not a de Polignac number, because 40300112534401 - 27 = 40300112534273 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40300112534401.
It is not a weakly prime, because it can be changed into another prime (40300112534471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20150056267200 + 20150056267201.
It is an arithmetic number, because the mean of its divisors is an integer number (20150056267201).
Almost surely, 240300112534401 is an apocalyptic number.
It is an amenable number.
40300112534401 is a deficient number, since it is larger than the sum of its proper divisors (1).
40300112534401 is an equidigital number, since it uses as much as digits as its factorization.
40300112534401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 40300112534401 its reverse (10443521100304), we get a palindrome (50743633634705).
The spelling of 40300112534401 in words is "forty trillion, three hundred billion, one hundred twelve million, five hundred thirty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •