Base | Representation |
---|---|
bin | 110111111011110110… |
… | …1011100011010100101 |
3 | 102111001100222100120212 |
4 | 1233313231130122211 |
5 | 3432001210032323 |
6 | 131103220305205 |
7 | 11451454113041 |
oct | 1576755343245 |
9 | 374040870525 |
10 | 120120002213 |
11 | 46a40678602 |
12 | 1b343b42205 |
13 | b4340122b3 |
14 | 5b57263021 |
15 | 31d07abb78 |
hex | 1bf7b5c6a5 |
120120002213 has 4 divisors (see below), whose sum is σ = 120135004608. Its totient is φ = 120104999820.
The previous prime is 120120002209. The next prime is 120120002231. The reversal of 120120002213 is 312200021021.
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 120120002213 - 22 = 120120002209 is a prime.
It is a super-2 number, since 2×1201200022132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120120602213) 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, 7489181 + ... + 7505202.
It is an arithmetic number, because the mean of its divisors is an integer number (30033751152).
Almost surely, 2120120002213 is an apocalyptic number.
It is an amenable number.
120120002213 is a deficient number, since it is larger than the sum of its proper divisors (15002395).
120120002213 is an equidigital number, since it uses as much as digits as its factorization.
120120002213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15002394.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 120120002213 its reverse (312200021021), we get a palindrome (432320023234).
The spelling of 120120002213 in words is "one hundred twenty billion, one hundred twenty million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •