Base | Representation |
---|---|
bin | 110111111000111000… |
… | …0110011110001011101 |
3 | 102110210102012221112011 |
4 | 1233301300303301131 |
5 | 3431300134033041 |
6 | 131045253511221 |
7 | 11446133021551 |
oct | 1576160636135 |
9 | 373712187464 |
10 | 120020221021 |
11 | 4699a316508 |
12 | 1b316642511 |
13 | b41944727c |
14 | 5b47ccb861 |
15 | 31c6b4be81 |
hex | 1bf1c33c5d |
120020221021 has 4 divisors (see below), whose sum is σ = 120155532192. Its totient is φ = 119884909852.
The previous prime is 120020220941. The next prime is 120020221031. The reversal of 120020221021 is 120122020021.
It is a happy number.
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 120020221021 - 27 = 120020220893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120020220992 and 120020221010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120020221031) 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, 67654255 + ... + 67656028.
It is an arithmetic number, because the mean of its divisors is an integer number (30038883048).
Almost surely, 2120020221021 is an apocalyptic number.
It is an amenable number.
120020221021 is a deficient number, since it is larger than the sum of its proper divisors (135311171).
120020221021 is an equidigital number, since it uses as much as digits as its factorization.
120020221021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135311170.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 120020221021 its reverse (120122020021), we get a palindrome (240142241042).
The spelling of 120020221021 in words is "one hundred twenty billion, twenty million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •