Base | Representation |
---|---|
bin | 111010011111111100101… |
… | …101111100011101100001 |
3 | 112020022102002210211022001 |
4 | 322133330231330131201 |
5 | 1011331012241334241 |
6 | 12314440035044001 |
7 | 563303124645661 |
oct | 72377455743541 |
9 | 15208362724261 |
10 | 4020034324321 |
11 | 130a983634aa4 |
12 | 54b139440601 |
13 | 23211a630702 |
14 | dc7dbddc1a1 |
15 | 6e884c56431 |
hex | 3a7fcb7c761 |
4020034324321 has 32 divisors (see below), whose sum is σ = 4576124160000. Its totient is φ = 3512373580800.
The previous prime is 4020034324261. The next prime is 4020034324363. The reversal of 4020034324321 is 1234234300204.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4020034324321 is a prime.
It is a super-2 number, since 2×40200343243212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4020034324321.
It is not an unprimeable number, because it can be changed into a prime (4020034324381) 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, 67446 + ... + 2836303.
It is an arithmetic number, because the mean of its divisors is an integer number (143003880000).
Almost surely, 24020034324321 is an apocalyptic number.
It is an amenable number.
4020034324321 is a deficient number, since it is larger than the sum of its proper divisors (556089835679).
4020034324321 is a wasteful number, since it uses less digits than its factorization.
4020034324321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2903905.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 4020034324321 its reverse (1234234300204), we get a palindrome (5254268624525).
The spelling of 4020034324321 in words is "four trillion, twenty billion, thirty-four million, three hundred twenty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •