Base | Representation |
---|---|
bin | 100100000100010… |
… | …1000010110111101 |
3 | 10010100020122111112 |
4 | 1020020220112331 |
5 | 4434304101023 |
6 | 320031131405 |
7 | 41663501030 |
oct | 11010502675 |
9 | 3110218445 |
10 | 1210222013 |
11 | 571158790 |
12 | 299373b65 |
13 | 163963100 |
14 | b6a31017 |
15 | 713a9478 |
hex | 482285bd |
1210222013 has 24 divisors (see below), whose sum is σ = 1633859136. Its totient is φ = 870480000.
The previous prime is 1210222007. The next prime is 1210222037. The reversal of 1210222013 is 3102220121.
It is a happy number.
It is not a de Polignac number, because 1210222013 - 26 = 1210221949 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210222063) 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 23 ways as a sum of consecutive naturals, for example, 33488 + ... + 59513.
It is an arithmetic number, because the mean of its divisors is an integer number (68077464).
Almost surely, 21210222013 is an apocalyptic number.
1210222013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1210222013 is a deficient number, since it is larger than the sum of its proper divisors (423637123).
1210222013 is a wasteful number, since it uses less digits than its factorization.
1210222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93045 (or 93032 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1210222013 is about 34788.2453279840. The cubic root of 1210222013 is about 1065.6674056596.
Adding to 1210222013 its reverse (3102220121), we get a palindrome (4312442134).
The spelling of 1210222013 in words is "one billion, two hundred ten million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •