Base | Representation |
---|---|
bin | 10011001000000010… |
… | …10100111101000001 |
3 | 222111121001122201102 |
4 | 21210001110331001 |
5 | 132012102113121 |
6 | 4414514544145 |
7 | 512310411122 |
oct | 114401247501 |
9 | 28447048642 |
10 | 10268004161 |
11 | 439a025558 |
12 | 1ba6898055 |
13 | c78394a0c |
14 | 6d59a8049 |
15 | 40169b90b |
hex | 264054f41 |
10268004161 has 8 divisors (see below), whose sum is σ = 10731582120. Its totient is φ = 9811726848.
The previous prime is 10268004151. The next prime is 10268004179. The reversal of 10268004161 is 16140086201.
It can be written as a sum of positive squares in 4 ways, for example, as 1416769600 + 8851234561 = 37640^2 + 94081^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10268004161 - 226 = 10200895297 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10268004121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1822286 + ... + 1827911.
It is an arithmetic number, because the mean of its divisors is an integer number (1341447765).
Almost surely, 210268004161 is an apocalyptic number.
It is an amenable number.
10268004161 is a deficient number, since it is larger than the sum of its proper divisors (463577959).
10268004161 is an equidigital number, since it uses as much as digits as its factorization.
10268004161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3650323.
The product of its (nonzero) digits is 2304, while the sum is 29.
The spelling of 10268004161 in words is "ten billion, two hundred sixty-eight million, four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •