Base | Representation |
---|---|
bin | 111101011001011… |
… | …000000001111001 |
3 | 2122210020120200220 |
4 | 331121120001321 |
5 | 4102143442301 |
6 | 250113450253 |
7 | 34345245540 |
oct | 7531300171 |
9 | 2583216626 |
10 | 1030062201 |
11 | 489496a83 |
12 | 248b70989 |
13 | 13553457c |
14 | 9ab35157 |
15 | 6066d936 |
hex | 3d658079 |
1030062201 has 8 divisors (see below), whose sum is σ = 1569618624. Its totient is φ = 588606960.
The previous prime is 1030062161. The next prime is 1030062217. The reversal of 1030062201 is 1022600301.
1030062201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1030062201 - 27 = 1030062073 is a prime.
It is a super-2 number, since 2×10300622012 = 2122056275857928802, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1030062251) 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, 24525270 + ... + 24525311.
It is an arithmetic number, because the mean of its divisors is an integer number (196202328).
Almost surely, 21030062201 is an apocalyptic number.
It is an amenable number.
1030062201 is a deficient number, since it is larger than the sum of its proper divisors (539556423).
1030062201 is an equidigital number, since it uses as much as digits as its factorization.
1030062201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49050591.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1030062201 is about 32094.5821128738. The cubic root of 1030062201 is about 1009.9219627319.
Adding to 1030062201 its reverse (1022600301), we get a palindrome (2052662502).
The spelling of 1030062201 in words is "one billion, thirty million, sixty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •