Base | Representation |
---|---|
bin | 111010100000000010011… |
… | …011101100000110110001 |
3 | 112020022122210012220210102 |
4 | 322200002123230012301 |
5 | 1011331211312431113 |
6 | 12314453342042145 |
7 | 563305400621561 |
oct | 72400233540661 |
9 | 15208583186712 |
10 | 4020130202033 |
11 | 130aa22770380 |
12 | 54b165579355 |
13 | 23213445ca9a |
14 | dc80aa38da1 |
15 | 6e88d394758 |
hex | 3a8026ec1b1 |
4020130202033 has 32 divisors (see below), whose sum is σ = 4679380592640. Its totient is φ = 3415352463360.
The previous prime is 4020130202029. The next prime is 4020130202057. The reversal of 4020130202033 is 3302020310204.
It is a cyclic number.
It is not a de Polignac number, because 4020130202033 - 22 = 4020130202029 is a prime.
It is a super-2 number, since 2×40201302020332 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4020130201996 and 4020130202014.
It is not an unprimeable number, because it can be changed into a prime (4020130202233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5169116 + ... + 5895762.
It is an arithmetic number, because the mean of its divisors is an integer number (146230643520).
Almost surely, 24020130202033 is an apocalyptic number.
It is an amenable number.
4020130202033 is a deficient number, since it is larger than the sum of its proper divisors (659250390607).
4020130202033 is a wasteful number, since it uses less digits than its factorization.
4020130202033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 727037.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 4020130202033 its reverse (3302020310204), we get a palindrome (7322150512237).
The spelling of 4020130202033 in words is "four trillion, twenty billion, one hundred thirty million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •