Base | Representation |
---|---|
bin | 10011000110100111… |
… | …11101101001001101 |
3 | 222110202200111000121 |
4 | 21203103331221031 |
5 | 132001031042310 |
6 | 4413412024541 |
7 | 512104341523 |
oct | 114323755115 |
9 | 28422614017 |
10 | 10256112205 |
11 | 4393342999 |
12 | 1ba2902151 |
13 | c75a8cc61 |
14 | 6d4190313 |
15 | 4005ed0da |
hex | 2634fda4d |
10256112205 has 8 divisors (see below), whose sum is σ = 12307991904. Its totient is φ = 8204451600.
The previous prime is 10256112193. The next prime is 10256112281. The reversal of 10256112205 is 50221165201.
10256112205 is digitally balanced in base 3, 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 10256112205 - 221 = 10254015053 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10256112205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77070 + ... + 162640.
It is an arithmetic number, because the mean of its divisors is an integer number (1538498988).
Almost surely, 210256112205 is an apocalyptic number.
It is an amenable number.
10256112205 is a deficient number, since it is larger than the sum of its proper divisors (2051879699).
10256112205 is an equidigital number, since it uses as much as digits as its factorization.
10256112205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109547.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 10256112205 its reverse (50221165201), we get a palindrome (60477277406).
The spelling of 10256112205 in words is "ten billion, two hundred fifty-six million, one hundred twelve thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •