Base | Representation |
---|---|
bin | 100100000011111… |
… | …0101001000101001 |
3 | 10010022211222200201 |
4 | 1020013311020221 |
5 | 4434230342301 |
6 | 320022432201 |
7 | 41661635236 |
oct | 11007651051 |
9 | 3108758621 |
10 | 1210012201 |
11 | 571025092 |
12 | 299292661 |
13 | 1638bb768 |
14 | b69b878d |
15 | 71367201 |
hex | 481f5229 |
1210012201 has 4 divisors (see below), whose sum is σ = 1210192132. Its totient is φ = 1209832272.
The previous prime is 1210012187. The next prime is 1210012229. The reversal of 1210012201 is 1022100121.
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 485056576 + 724955625 = 22024^2 + 26925^2 .
It is a cyclic number.
It is not a de Polignac number, because 1210012201 - 213 = 1210004009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1210012291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79470 + ... + 93463.
It is an arithmetic number, because the mean of its divisors is an integer number (302548033).
Almost surely, 21210012201 is an apocalyptic number.
It is an amenable number.
1210012201 is a deficient number, since it is larger than the sum of its proper divisors (179931).
1210012201 is an equidigital number, since it uses as much as digits as its factorization.
1210012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179930.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1210012201 is about 34785.2296384543. The cubic root of 1210012201 is about 1065.6058184110.
Adding to 1210012201 its reverse (1022100121), we get a palindrome (2232112322).
The spelling of 1210012201 in words is "one billion, two hundred ten million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •