Base | Representation |
---|---|
bin | 111100001101001… |
… | …111011101100001 |
3 | 2121101200121102020 |
4 | 330031033131201 |
5 | 4032041313121 |
6 | 244122012053 |
7 | 34013513043 |
oct | 7415173541 |
9 | 2541617366 |
10 | 1010104161 |
11 | 4791a5230 |
12 | 242347029 |
13 | 131367291 |
14 | 9821ba93 |
15 | 5da2a1c6 |
hex | 3c34f761 |
1010104161 has 16 divisors (see below), whose sum is σ = 1473493248. Its totient is φ = 610413200.
The previous prime is 1010104159. The next prime is 1010104177. The reversal of 1010104161 is 1614010101.
It is a cyclic number.
It is not a de Polignac number, because 1010104161 - 21 = 1010104159 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010104161.
It is not an unprimeable number, because it can be changed into a prime (1010104111) 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 15 ways as a sum of consecutive naturals, for example, 32655 + ... + 55556.
It is an arithmetic number, because the mean of its divisors is an integer number (92093328).
Almost surely, 21010104161 is an apocalyptic number.
1010104161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1010104161 is a deficient number, since it is larger than the sum of its proper divisors (463389087).
1010104161 is a wasteful number, since it uses less digits than its factorization.
1010104161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88572.
The product of its (nonzero) digits is 24, while the sum is 15.
The square root of 1010104161 is about 31782.1358785089. The cubic root of 1010104161 is about 1003.3567731328.
Adding to 1010104161 its reverse (1614010101), we get a palindrome (2624114262).
The spelling of 1010104161 in words is "one billion, ten million, one hundred four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •