Base | Representation |
---|---|
bin | 110111111110100110… |
… | …0110001011110011101 |
3 | 102111021210021110101211 |
4 | 1233331030301132131 |
5 | 3432143244213041 |
6 | 131120310304421 |
7 | 11453652666505 |
oct | 1577514613635 |
9 | 374253243354 |
10 | 120212101021 |
11 | 46a88662821 |
12 | 1b36a958111 |
13 | b44a11a62c |
14 | 5b65598a05 |
15 | 31d8900481 |
hex | 1bfd33179d |
120212101021 has 4 divisors (see below), whose sum is σ = 122006311552. Its totient is φ = 118417890492.
The previous prime is 120212101013. The next prime is 120212101049. The reversal of 120212101021 is 120101212021.
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.
It is a cyclic number.
It is not a de Polignac number, because 120212101021 - 23 = 120212101013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120212100992 and 120212101010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120212101081) 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, 897105165 + ... + 897105298.
It is an arithmetic number, because the mean of its divisors is an integer number (30501577888).
Almost surely, 2120212101021 is an apocalyptic number.
It is an amenable number.
120212101021 is a deficient number, since it is larger than the sum of its proper divisors (1794210531).
120212101021 is an equidigital number, since it uses as much as digits as its factorization.
120212101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1794210530.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120212101021 its reverse (120101212021), we get a palindrome (240313313042).
The spelling of 120212101021 in words is "one hundred twenty billion, two hundred twelve million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •