Base | Representation |
---|---|
bin | 111100010100111… |
… | …110000110101101 |
3 | 2121112111112122111 |
4 | 330110332012231 |
5 | 4033101131341 |
6 | 244233244021 |
7 | 34036651654 |
oct | 7424760655 |
9 | 2545445574 |
10 | 1012130221 |
11 | 47a359463 |
12 | 242b63611 |
13 | 1318c652b |
14 | 985c819b |
15 | 5dcca681 |
hex | 3c53e1ad |
1012130221 has 4 divisors (see below), whose sum is σ = 1021956832. Its totient is φ = 1002303612.
The previous prime is 1012130213. The next prime is 1012130233. The reversal of 1012130221 is 1220312101.
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 1012130221 - 23 = 1012130213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012130281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4913151 + ... + 4913356.
It is an arithmetic number, because the mean of its divisors is an integer number (255489208).
Almost surely, 21012130221 is an apocalyptic number.
It is an amenable number.
1012130221 is a deficient number, since it is larger than the sum of its proper divisors (9826611).
1012130221 is an equidigital number, since it uses as much as digits as its factorization.
1012130221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9826610.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1012130221 is about 31813.9941063677. The cubic root of 1012130221 is about 1004.0271671537.
Adding to 1012130221 its reverse (1220312101), we get a palindrome (2232442322).
The spelling of 1012130221 in words is "one billion, twelve million, one hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •