Base | Representation |
---|---|
bin | 111101011001111… |
… | …110110110011101 |
3 | 2122210112122211020 |
4 | 331121332312131 |
5 | 4102214034323 |
6 | 250121114353 |
7 | 34346510250 |
oct | 7531766635 |
9 | 2583478736 |
10 | 1030221213 |
11 | 48959549a |
12 | 2490289b9 |
13 | 13558ba68 |
14 | 9ab77097 |
15 | 606a0ae3 |
hex | 3d67ed9d |
1030221213 has 8 divisors (see below), whose sum is σ = 1569860928. Its totient is φ = 588697824.
The previous prime is 1030221167. The next prime is 1030221263. The reversal of 1030221213 is 3121220301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1030221213 - 210 = 1030220189 is a prime.
It is a super-2 number, since 2×10302212132 = 2122711495430382738, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030221192 and 1030221201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030221263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24529056 + ... + 24529097.
It is an arithmetic number, because the mean of its divisors is an integer number (196232616).
Almost surely, 21030221213 is an apocalyptic number.
It is an amenable number.
1030221213 is a deficient number, since it is larger than the sum of its proper divisors (539639715).
1030221213 is an equidigital number, since it uses as much as digits as its factorization.
1030221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49058163.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1030221213 is about 32097.0592578199. The cubic root of 1030221213 is about 1009.9739277000.
Adding to 1030221213 its reverse (3121220301), we get a palindrome (4151441514).
The spelling of 1030221213 in words is "one billion, thirty million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •