Base | Representation |
---|---|
bin | 11011010111111011111110… |
… | …000011110110001101001001 |
3 | 120210021101022010020022122121 |
4 | 123113323332003312031021 |
5 | 111240001204101300301 |
6 | 1104015224452251241 |
7 | 34234022561651155 |
oct | 3327737603661511 |
9 | 523241263208577 |
10 | 120392195728201 |
11 | 353a7052963701 |
12 | 11604992910b21 |
13 | 5223c20c449b7 |
14 | 21a3028958065 |
15 | ddba25d173a1 |
hex | 6d7efe0f6349 |
120392195728201 has 16 divisors (see below), whose sum is σ = 126233679116160. Its totient is φ = 114690650820480.
The previous prime is 120392195728183. The next prime is 120392195728229. The reversal of 120392195728201 is 102827591293021.
It is a cyclic number.
It is not a de Polignac number, because 120392195728201 - 217 = 120392195597129 is a prime.
It is a super-2 number, since 2×1203921957282012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120392195723201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3987021 + ... + 16021258.
It is an arithmetic number, because the mean of its divisors is an integer number (7889604944760).
Almost surely, 2120392195728201 is an apocalyptic number.
It is an amenable number.
120392195728201 is a deficient number, since it is larger than the sum of its proper divisors (5841483387959).
120392195728201 is a wasteful number, since it uses less digits than its factorization.
120392195728201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20011776.
The product of its (nonzero) digits is 1088640, while the sum is 52.
The spelling of 120392195728201 in words is "one hundred twenty trillion, three hundred ninety-two billion, one hundred ninety-five million, seven hundred twenty-eight thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •