Base | Representation |
---|---|
bin | 111010111100001001111… |
… | …001011010010101000001 |
3 | 112100012120210000222101221 |
4 | 322330021321122111001 |
5 | 1012330023433030441 |
6 | 12340405202355041 |
7 | 565424465460361 |
oct | 72741171322501 |
9 | 15305523028357 |
10 | 4050320205121 |
11 | 1321805189553 |
12 | 554b9005ba81 |
13 | 234c35cbbb38 |
14 | 1000723c29a1 |
15 | 70558a008d1 |
hex | 3af09e5a541 |
4050320205121 has 16 divisors (see below), whose sum is σ = 4297650194880. Its totient is φ = 3804003717120.
The previous prime is 4050320205089. The next prime is 4050320205137. The reversal of 4050320205121 is 1215020230504.
4050320205121 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4050320205121 - 25 = 4050320205089 is a prime.
It is a super-2 number, since 2×40503202051212 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4050320203121) 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, 26004486 + ... + 26159776.
It is an arithmetic number, because the mean of its divisors is an integer number (268603137180).
Almost surely, 24050320205121 is an apocalyptic number.
It is an amenable number.
4050320205121 is a deficient number, since it is larger than the sum of its proper divisors (247329989759).
4050320205121 is a wasteful number, since it uses less digits than its factorization.
4050320205121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158544.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 4050320205121 its reverse (1215020230504), we get a palindrome (5265340435625).
The spelling of 4050320205121 in words is "four trillion, fifty billion, three hundred twenty million, two hundred five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •