Base | Representation |
---|---|
bin | 10010001111111110011000… |
… | …00000000101001111000001 |
3 | 12021002111220102211201122111 |
4 | 21013333030000011033001 |
5 | 20230002401304120113 |
6 | 221204022102135321 |
7 | 11311251034563610 |
oct | 1107771400051701 |
9 | 167074812751574 |
10 | 40131302020033 |
11 | 11872653851114 |
12 | 460186ba21541 |
13 | 195149a133843 |
14 | 9ca51886d877 |
15 | 498d9201e13d |
hex | 247fcc0053c1 |
40131302020033 has 16 divisors (see below), whose sum is σ = 46037570987520. Its totient is φ = 34268354657856.
The previous prime is 40131302020001. The next prime is 40131302020063. The reversal of 40131302020033 is 33002020313104.
It is a cyclic number.
It is not a de Polignac number, because 40131302020033 - 25 = 40131302020001 is a prime.
It is a super-2 number, since 2×401313020200332 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40131302019986 and 40131302020013.
It is not an unprimeable number, because it can be changed into a prime (40131302020063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31608760 + ... + 32853862.
It is an arithmetic number, because the mean of its divisors is an integer number (2877348186720).
Almost surely, 240131302020033 is an apocalyptic number.
It is an amenable number.
40131302020033 is a deficient number, since it is larger than the sum of its proper divisors (5906268967487).
40131302020033 is a wasteful number, since it uses less digits than its factorization.
40131302020033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1262496.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 40131302020033 its reverse (33002020313104), we get a palindrome (73133322333137).
The spelling of 40131302020033 in words is "forty trillion, one hundred thirty-one billion, three hundred two million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •