Base | Representation |
---|---|
bin | 11011010010100110011111… |
… | …001010000100100100001001 |
3 | 120201222022212122102200002202 |
4 | 123102212133022010210021 |
5 | 111212444242003213301 |
6 | 1103134545021205545 |
7 | 34165362361532315 |
oct | 3322463712044411 |
9 | 521868778380082 |
10 | 120025531304201 |
11 | 352755a63a8a16 |
12 | 115659037008b5 |
13 | 51c8488a58a73 |
14 | 218d3a3bdab45 |
15 | dd2215cc666b |
hex | 6d299f284909 |
120025531304201 has 32 divisors (see below), whose sum is σ = 122926172054400. Its totient is φ = 117150293145600.
The previous prime is 120025531304179. The next prime is 120025531304221. The reversal of 120025531304201 is 102403135520021.
It is a cyclic number.
It is not a de Polignac number, because 120025531304201 - 214 = 120025531287817 is a prime.
It is a super-2 number, since 2×1200255313042012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (120025531304221) 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, 29281659650 + ... + 29281663748.
It is an arithmetic number, because the mean of its divisors is an integer number (3841442876700).
Almost surely, 2120025531304201 is an apocalyptic number.
It is an amenable number.
120025531304201 is a deficient number, since it is larger than the sum of its proper divisors (2900640750199).
120025531304201 is a wasteful number, since it uses less digits than its factorization.
120025531304201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7817.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 120025531304201 its reverse (102403135520021), we get a palindrome (222428666824222).
The spelling of 120025531304201 in words is "one hundred twenty trillion, twenty-five billion, five hundred thirty-one million, three hundred four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •