Base | Representation |
---|---|
bin | 10010010101001011100110… |
… | …01011110000001000001001 |
3 | 12021201121200011221211110010 |
4 | 21022211303023300020021 |
5 | 20240420242314033023 |
6 | 221422130034142133 |
7 | 11330213230060011 |
oct | 1112456313601011 |
9 | 167647604854403 |
10 | 40310200533513 |
11 | 11931507353159 |
12 | 4630478721949 |
13 | 196530a7c6901 |
14 | 9d504a260c41 |
15 | 49d862b9b093 |
hex | 24a9732f0209 |
40310200533513 has 16 divisors (see below), whose sum is σ = 53903366101760. Its totient is φ = 26795364108624.
The previous prime is 40310200533461. The next prime is 40310200533653. The reversal of 40310200533513 is 31533500201304.
It is not a de Polignac number, because 40310200533513 - 225 = 40310166979081 is a prime.
It is a super-2 number, since 2×403102005335132 (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 (40310200533913) 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 in 15 ways as a sum of consecutive naturals, for example, 12713131 + ... + 15564192.
It is an arithmetic number, because the mean of its divisors is an integer number (3368960381360).
Almost surely, 240310200533513 is an apocalyptic number.
It is an amenable number.
40310200533513 is a deficient number, since it is larger than the sum of its proper divisors (13593165568247).
40310200533513 is a wasteful number, since it uses less digits than its factorization.
40310200533513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28278708.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 40310200533513 its reverse (31533500201304), we get a palindrome (71843700734817).
The spelling of 40310200533513 in words is "forty trillion, three hundred ten billion, two hundred million, five hundred thirty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •