Base | Representation |
---|---|
bin | 11011010110001001110101… |
… | …110000101110100100111001 |
3 | 120202211122222200200210022101 |
4 | 123112021311300232210321 |
5 | 111230444220340234203 |
6 | 1103443040414423401 |
7 | 34222124020604164 |
oct | 3326116560564471 |
9 | 522748880623271 |
10 | 120269649930553 |
11 | 3535a087a65092 |
12 | 115a5092501b61 |
13 | 52154c14b47b6 |
14 | 219b12147cadb |
15 | dd87525db41d |
hex | 6d6275c2e939 |
120269649930553 has 4 divisors (see below), whose sum is σ = 120269958997540. Its totient is φ = 120269340863568.
The previous prime is 120269649930497. The next prime is 120269649930587. The reversal of 120269649930553 is 355039946962021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 86461507147024 + 33808142783529 = 9298468^2 + 5814477^2 .
It is a cyclic number.
It is not a de Polignac number, because 120269649930553 - 213 = 120269649922361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120269649930593) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153949050 + ... + 154728307.
It is an arithmetic number, because the mean of its divisors is an integer number (30067489749385).
Almost surely, 2120269649930553 is an apocalyptic number.
It is an amenable number.
120269649930553 is a deficient number, since it is larger than the sum of its proper divisors (309066987).
120269649930553 is an equidigital number, since it uses as much as digits as its factorization.
120269649930553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309066986.
The product of its (nonzero) digits is 94478400, while the sum is 64.
The spelling of 120269649930553 in words is "one hundred twenty trillion, two hundred sixty-nine billion, six hundred forty-nine million, nine hundred thirty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •