Base | Representation |
---|---|
bin | 110111111011010100… |
… | …0110001110111001011 |
3 | 102111000010002212002212 |
4 | 1233312220301313023 |
5 | 3431432103031443 |
6 | 131101334415335 |
7 | 11451145113455 |
oct | 1576650616713 |
9 | 374003085085 |
10 | 120102002123 |
11 | 46a314a38a4 |
12 | 1b339b0154b |
13 | b43037c25c |
14 | 5b54ad92d5 |
15 | 31cde03618 |
hex | 1bf6a31dcb |
120102002123 has 8 divisors (see below), whose sum is σ = 124119945216. Its totient is φ = 116093039400.
The previous prime is 120102002107. The next prime is 120102002147. The reversal of 120102002123 is 321200201021.
It is a happy number.
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 120102002123 - 24 = 120102002107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120102002098 and 120102002107.
It is not an unprimeable number, because it can be changed into a prime (120102004123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2217893 + ... + 2271398.
It is an arithmetic number, because the mean of its divisors is an integer number (15514993152).
Almost surely, 2120102002123 is an apocalyptic number.
120102002123 is a deficient number, since it is larger than the sum of its proper divisors (4017943093).
120102002123 is an equidigital number, since it uses as much as digits as its factorization.
120102002123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4490185.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 120102002123 its reverse (321200201021), we get a palindrome (441302203144).
The spelling of 120102002123 in words is "one hundred twenty billion, one hundred two million, two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •