Base | Representation |
---|---|
bin | 110111111000010101… |
… | …1111011010110101101 |
3 | 102110202011020120010211 |
4 | 1233300223323112231 |
5 | 3431231023223031 |
6 | 131043410502421 |
7 | 11445523364566 |
oct | 1576053732655 |
9 | 373664216124 |
10 | 120002164141 |
11 | 46990103072 |
12 | 1b310594a11 |
13 | b415794422 |
14 | 5b4574b16d |
15 | 31c5281bb1 |
hex | 1bf0afb5ad |
120002164141 has 4 divisors (see below), whose sum is σ = 120028560192. Its totient is φ = 119975768092.
The previous prime is 120002164097. The next prime is 120002164153. The reversal of 120002164141 is 141461200021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141461200021 = 51517 ⋅2745913.
It is a cyclic number.
It is not a de Polignac number, because 120002164141 - 27 = 120002164013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120002164241) 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, 13191205 + ... + 13200298.
It is an arithmetic number, because the mean of its divisors is an integer number (30007140048).
Almost surely, 2120002164141 is an apocalyptic number.
It is an amenable number.
120002164141 is a deficient number, since it is larger than the sum of its proper divisors (26396051).
120002164141 is an equidigital number, since it uses as much as digits as its factorization.
120002164141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26396050.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 120002164141 its reverse (141461200021), we get a palindrome (261463364162).
The spelling of 120002164141 in words is "one hundred twenty billion, two million, one hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •