Base | Representation |
---|---|
bin | 10010110110111011… |
… | …00001001000111001 |
3 | 222010120211202200201 |
4 | 21123131201020321 |
5 | 131213321233121 |
6 | 4352345002201 |
7 | 505614654502 |
oct | 113335411071 |
9 | 28116752621 |
10 | 10124399161 |
11 | 4325a60a38 |
12 | 1b66783361 |
13 | c546c4846 |
14 | 6c08a5ba9 |
15 | 3e3c81e91 |
hex | 25b761239 |
10124399161 has 8 divisors (see below), whose sum is σ = 10147181184. Its totient is φ = 10101635280.
The previous prime is 10124399143. The next prime is 10124399209. The reversal of 10124399161 is 16199342101.
10124399161 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 a cyclic number.
It is not a de Polignac number, because 10124399161 - 29 = 10124398649 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 10124399161.
It is not an unprimeable number, because it can be changed into a prime (10124399101) 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, 2202976 + ... + 2207566.
It is an arithmetic number, because the mean of its divisors is an integer number (1268397648).
Almost surely, 210124399161 is an apocalyptic number.
It is an amenable number.
10124399161 is a deficient number, since it is larger than the sum of its proper divisors (22782023).
10124399161 is an equidigital number, since it uses as much as digits as its factorization.
10124399161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9071.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 10124399161 in words is "ten billion, one hundred twenty-four million, three hundred ninety-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •