Base | Representation |
---|---|
bin | 111010011001011011110… |
… | …110000110011011000101 |
3 | 112012122100200102210022011 |
4 | 322121123312012123011 |
5 | 1011222201313110310 |
6 | 12311322034134221 |
7 | 562634611160536 |
oct | 72313366063305 |
9 | 15178320383264 |
10 | 4013040363205 |
11 | 1307a14735545 |
12 | 549907121371 |
13 | 231574660393 |
14 | dc3371b468d |
15 | 6e5c5c3178a |
hex | 3a65bd866c5 |
4013040363205 has 32 divisors (see below), whose sum is σ = 5203236994560. Its totient is φ = 2961639152640.
The previous prime is 4013040363197. The next prime is 4013040363221. The reversal of 4013040363205 is 5023630403104.
4013040363205 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4013040363205 - 23 = 4013040363197 is a prime.
It is a super-2 number, since 2×40130403632052 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1401556 + ... + 3160765.
It is an arithmetic number, because the mean of its divisors is an integer number (162601156080).
Almost surely, 24013040363205 is an apocalyptic number.
It is an amenable number.
4013040363205 is a deficient number, since it is larger than the sum of its proper divisors (1190196631355).
4013040363205 is a wasteful number, since it uses less digits than its factorization.
4013040363205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4562589.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 4013040363205 its reverse (5023630403104), we get a palindrome (9036670766309).
The spelling of 4013040363205 in words is "four trillion, thirteen billion, forty million, three hundred sixty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •