Base | Representation |
---|---|
bin | 10011000001110110… |
… | …10101001101110001 |
3 | 222100222101200120210 |
4 | 21200323111031301 |
5 | 131410310210341 |
6 | 4405422254333 |
7 | 511110265131 |
oct | 114073251561 |
9 | 28328350523 |
10 | 10216100721 |
11 | 43727a4752 |
12 | 1b914273a9 |
13 | c6a6c1118 |
14 | 6ccb36ac1 |
15 | 3ebd47c16 |
hex | 260ed5371 |
10216100721 has 8 divisors (see below), whose sum is σ = 13844770624. Its totient is φ = 6699082320.
The previous prime is 10216100689. The next prime is 10216100759. The reversal of 10216100721 is 12700161201.
It is a happy number.
10216100721 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 10216100721 - 25 = 10216100689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10216100771) 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, 27912661 + ... + 27913026.
It is an arithmetic number, because the mean of its divisors is an integer number (1730596328).
Almost surely, 210216100721 is an apocalyptic number.
It is an amenable number.
10216100721 is a deficient number, since it is larger than the sum of its proper divisors (3628669903).
10216100721 is an equidigital number, since it uses as much as digits as its factorization.
10216100721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55825751.
The product of its (nonzero) digits is 168, while the sum is 21.
Adding to 10216100721 its reverse (12700161201), we get a palindrome (22916261922).
The spelling of 10216100721 in words is "ten billion, two hundred sixteen million, one hundred thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •