Base | Representation |
---|---|
bin | 11110110110110001110… |
… | …000110100100100101101 |
3 | 21111201010102000200120122 |
4 | 132312301300310210231 |
5 | 234220040204224123 |
6 | 4302033205254325 |
7 | 306123343115306 |
oct | 36666160644455 |
9 | 7451112020518 |
10 | 2120401242413 |
11 | 74829124a303 |
12 | 2a2b461043a5 |
13 | 124c5090668c |
14 | 748b12017ad |
15 | 3a2532debc8 |
hex | 1edb1c3492d |
2120401242413 has 8 divisors (see below), whose sum is σ = 2125367640000. Its totient is φ = 2115437714208.
The previous prime is 2120401242389. The next prime is 2120401242497. The reversal of 2120401242413 is 3142421040212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2120401242413 - 216 = 2120401176877 is a prime.
It is a super-2 number, since 2×21204012424132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120401242613) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 765920 + ... + 2197142.
It is an arithmetic number, because the mean of its divisors is an integer number (265670955000).
Almost surely, 22120401242413 is an apocalyptic number.
It is an amenable number.
2120401242413 is a deficient number, since it is larger than the sum of its proper divisors (4966397587).
2120401242413 is a wasteful number, since it uses less digits than its factorization.
2120401242413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1434691.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 2120401242413 its reverse (3142421040212), we get a palindrome (5262822282625).
The spelling of 2120401242413 in words is "two trillion, one hundred twenty billion, four hundred one million, two hundred forty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •