Base | Representation |
---|---|
bin | 110111111110111011… |
… | …1001111000011001001 |
3 | 102111022120012222111202 |
4 | 1233331313033003021 |
5 | 3432204121412301 |
6 | 131121345033545 |
7 | 11454146420102 |
oct | 1577567170311 |
9 | 374276188452 |
10 | 120223232201 |
11 | 46a93975846 |
12 | 1b3726258b5 |
13 | b44c517027 |
14 | 5b66c553a9 |
15 | 31d989d66b |
hex | 1bfddcf0c9 |
120223232201 has 4 divisors (see below), whose sum is σ = 120752850192. Its totient is φ = 119693614212.
The previous prime is 120223232189. The next prime is 120223232221. The reversal of 120223232201 is 102232322021.
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 120223232201 - 214 = 120223215817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120223232221) 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, 264808655 + ... + 264809108.
It is an arithmetic number, because the mean of its divisors is an integer number (30188212548).
Almost surely, 2120223232201 is an apocalyptic number.
It is an amenable number.
120223232201 is a deficient number, since it is larger than the sum of its proper divisors (529617991).
120223232201 is an equidigital number, since it uses as much as digits as its factorization.
120223232201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 529617990.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 120223232201 its reverse (102232322021), we get a palindrome (222455554222).
It can be divided in two parts, 1 and 20223232201, that added together give a palindrome (20223232202).
The spelling of 120223232201 in words is "one hundred twenty billion, two hundred twenty-three million, two hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •