Base | Representation |
---|---|
bin | 10011011010111000… |
… | …11011000110010001 |
3 | 222220121112212101220 |
4 | 21231130123012101 |
5 | 132323040232121 |
6 | 4442323315253 |
7 | 516240256206 |
oct | 115534330621 |
9 | 28817485356 |
10 | 10426102161 |
11 | 4470298962 |
12 | 202b81bb29 |
13 | ca206a827 |
14 | 70c99dcad |
15 | 4104ca6c6 |
hex | 26d71b191 |
10426102161 has 8 divisors (see below), whose sum is σ = 14633125920. Its totient is φ = 6584906592.
The previous prime is 10426102157. The next prime is 10426102189. The reversal of 10426102161 is 16120162401.
It is a happy number.
10426102161 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 10426102161 - 22 = 10426102157 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10426102361) 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, 91456980 + ... + 91457093.
It is an arithmetic number, because the mean of its divisors is an integer number (1829140740).
Almost surely, 210426102161 is an apocalyptic number.
It is an amenable number.
10426102161 is a deficient number, since it is larger than the sum of its proper divisors (4207023759).
10426102161 is a wasteful number, since it uses less digits than its factorization.
10426102161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182914095.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 10426102161 its reverse (16120162401), we get a palindrome (26546264562).
The spelling of 10426102161 in words is "ten billion, four hundred twenty-six million, one hundred two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •