Base | Representation |
---|---|
bin | 10010110111001000… |
… | …11001011101100001 |
3 | 222010201020101201020 |
4 | 21123210121131201 |
5 | 131214301441341 |
6 | 4352451400053 |
7 | 505636205625 |
oct | 113344313541 |
9 | 28121211636 |
10 | 10126202721 |
11 | 4326a82a88 |
12 | 1b672b3029 |
13 | c54ba673b |
14 | 6c0c15185 |
15 | 3e3edb566 |
hex | 25b919761 |
10126202721 has 8 divisors (see below), whose sum is σ = 13502593440. Its totient is φ = 6750306912.
The previous prime is 10126202579. The next prime is 10126202743. The reversal of 10126202721 is 12720262101.
10126202721 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 10126202721 - 226 = 10059093857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10126202691 and 10126202700.
It is not an unprimeable number, because it can be changed into a prime (10126202521) 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 7 ways as a sum of consecutive naturals, for example, 73015 + ... + 159948.
It is an arithmetic number, because the mean of its divisors is an integer number (1687824180).
Almost surely, 210126202721 is an apocalyptic number.
It is an amenable number.
10126202721 is a deficient number, since it is larger than the sum of its proper divisors (3376390719).
10126202721 is a wasteful number, since it uses less digits than its factorization.
10126202721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247455.
The product of its (nonzero) digits is 672, while the sum is 24.
Adding to 10126202721 its reverse (12720262101), we get a palindrome (22846464822).
The spelling of 10126202721 in words is "ten billion, one hundred twenty-six million, two hundred two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •