Base | Representation |
---|---|
bin | 10010101010101000… |
… | …10110000101011111 |
3 | 221212101220101011100 |
4 | 21111110112011133 |
5 | 131010430100140 |
6 | 4334223524143 |
7 | 503223624213 |
oct | 112524260537 |
9 | 27771811140 |
10 | 10021331295 |
11 | 4282864588 |
12 | 1b38159653 |
13 | c39248841 |
14 | 6b0d16943 |
15 | 3d9bc3530 |
hex | 25551615f |
10021331295 has 24 divisors (see below), whose sum is σ = 17375054112. Its totient is φ = 5343249600.
The previous prime is 10021331249. The next prime is 10021331297. The reversal of 10021331295 is 59213312001.
10021331295 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 10021331295 - 26 = 10021331231 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021331297) 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 23 ways as a sum of consecutive naturals, for example, 147525 + ... + 204465.
It is an arithmetic number, because the mean of its divisors is an integer number (723960588).
Almost surely, 210021331295 is an apocalyptic number.
10021331295 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10021331295 is a deficient number, since it is larger than the sum of its proper divisors (7353722817).
10021331295 is a wasteful number, since it uses less digits than its factorization.
10021331295 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60863 (or 60860 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
Adding to 10021331295 its reverse (59213312001), we get a palindrome (69234643296).
The spelling of 10021331295 in words is "ten billion, twenty-one million, three hundred thirty-one thousand, two hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •