Base | Representation |
---|---|
bin | 10010101011101100… |
… | …10000101010110101 |
3 | 221220000122001220220 |
4 | 21111312100222311 |
5 | 131020214101010 |
6 | 4335142244553 |
7 | 503362323516 |
oct | 112566205265 |
9 | 27800561826 |
10 | 10030222005 |
11 | 4287887281 |
12 | 1b3b126759 |
13 | c3b03c50b |
14 | 6b218ca0d |
15 | 3da87c970 |
hex | 255d90ab5 |
10030222005 has 32 divisors (see below), whose sum is σ = 16112135424. Its totient is φ = 5328239616.
The previous prime is 10030221937. The next prime is 10030222039. The reversal of 10030222005 is 50022203001.
10030222005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10030222005 - 212 = 10030217909 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 6279867 + ... + 6281463.
It is an arithmetic number, because the mean of its divisors is an integer number (503504232).
Almost surely, 210030222005 is an apocalyptic number.
10030222005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10030222005 is a deficient number, since it is larger than the sum of its proper divisors (6081913419).
10030222005 is a wasteful number, since it uses less digits than its factorization.
10030222005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3005.
The product of its (nonzero) digits is 120, while the sum is 15.
Adding to 10030222005 its reverse (50022203001), we get a palindrome (60052425006).
The spelling of 10030222005 in words is "ten billion, thirty million, two hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •