Base | Representation |
---|---|
bin | 110111111011100011… |
… | …1010101011100101001 |
3 | 102111000200011210212102 |
4 | 1233313013111130221 |
5 | 3431441130342301 |
6 | 131102222223145 |
7 | 11451303154454 |
oct | 1576707253451 |
9 | 374020153772 |
10 | 120110012201 |
11 | 46a35a749a3 |
12 | 1b340724ab5 |
13 | b431c2514a |
14 | 5b55bc249b |
15 | 31ce986b6b |
hex | 1bf71d5729 |
120110012201 has 4 divisors (see below), whose sum is σ = 120227652804. Its totient is φ = 119992371600.
The previous prime is 120110012177. The next prime is 120110012207. The reversal of 120110012201 is 102210011021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25824168601 + 94285843600 = 160699^2 + 307060^2 .
It is a cyclic number.
It is not a de Polignac number, because 120110012201 - 26 = 120110012137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120110012207) 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 3 ways as a sum of consecutive naturals, for example, 58818770 + ... + 58820811.
It is an arithmetic number, because the mean of its divisors is an integer number (30056913201).
Almost surely, 2120110012201 is an apocalyptic number.
It is an amenable number.
120110012201 is a deficient number, since it is larger than the sum of its proper divisors (117640603).
120110012201 is a wasteful number, since it uses less digits than its factorization.
120110012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117640602.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120110012201 its reverse (102210011021), we get a palindrome (222320023222).
The spelling of 120110012201 in words is "one hundred twenty billion, one hundred ten million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •