Base | Representation |
---|---|
bin | 111010100000000010011… |
… | …011101100000110110011 |
3 | 112020022122210012220210111 |
4 | 322200002123230012303 |
5 | 1011331211312431120 |
6 | 12314453342042151 |
7 | 563305400621563 |
oct | 72400233540663 |
9 | 15208583186714 |
10 | 4020130202035 |
11 | 130aa22770382 |
12 | 54b165579357 |
13 | 23213445ca9c |
14 | dc80aa38da3 |
15 | 6e88d39475a |
hex | 3a8026ec1b3 |
4020130202035 has 8 divisors (see below), whose sum is σ = 4825935733536. Its totient is φ = 3214917834240.
The previous prime is 4020130202029. The next prime is 4020130202057. The reversal of 4020130202035 is 5302020310204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4020130202035 - 29 = 4020130201523 is a prime.
It is a super-2 number, since 2×40201302020352 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4020130201997 and 4020130202015.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 148276014 + ... + 148303123.
It is an arithmetic number, because the mean of its divisors is an integer number (603241966692).
Almost surely, 24020130202035 is an apocalyptic number.
4020130202035 is a deficient number, since it is larger than the sum of its proper divisors (805805531501).
4020130202035 is a wasteful number, since it uses less digits than its factorization.
4020130202035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296581853.
The product of its (nonzero) digits is 1440, while the sum is 22.
Adding to 4020130202035 its reverse (5302020310204), we get a palindrome (9322150512239).
The spelling of 4020130202035 in words is "four trillion, twenty billion, one hundred thirty million, two hundred two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •