Base | Representation |
---|---|
bin | 10010001100011100100011… |
… | …00000000001011101100001 |
3 | 12020122220221222022210022120 |
4 | 21012032101200001131201 |
5 | 20221011101213000103 |
6 | 221032211332054453 |
7 | 11266426423014261 |
oct | 1106162140013541 |
9 | 166586858283276 |
10 | 40010061453153 |
11 | 118261986a2810 |
12 | 45a2274764429 |
13 | 1942c17c2043c |
14 | 9c46d68777a1 |
15 | 495b481b8253 |
hex | 246391801761 |
40010061453153 has 32 divisors (see below), whose sum is σ = 59196744499200. Its totient is φ = 23832355636800.
The previous prime is 40010061453151. The next prime is 40010061453199. The reversal of 40010061453153 is 35135416001004.
It is a happy number.
It is not a de Polignac number, because 40010061453153 - 21 = 40010061453151 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40010061453151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5195443 + ... + 10344696.
It is an arithmetic number, because the mean of its divisors is an integer number (1849898265600).
Almost surely, 240010061453153 is an apocalyptic number.
It is an amenable number.
40010061453153 is a deficient number, since it is larger than the sum of its proper divisors (19186683046047).
40010061453153 is a wasteful number, since it uses less digits than its factorization.
40010061453153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15541493.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 40010061453153 its reverse (35135416001004), we get a palindrome (75145477454157).
The spelling of 40010061453153 in words is "forty trillion, ten billion, sixty-one million, four hundred fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •