Base | Representation |
---|---|
bin | 1111001100101010000110… |
… | …0111000100101111010001 |
3 | 2012011110202222110200100120 |
4 | 3303022201213010233101 |
5 | 4142234323320444431 |
6 | 55312310223340453 |
7 | 3343160462525151 |
oct | 363124147045721 |
9 | 65143688420316 |
10 | 16710134156241 |
11 | 536280110a6a9 |
12 | 1a5a652151729 |
13 | 9429b3384bb6 |
14 | 41aabc108761 |
15 | 1dea079e1196 |
hex | f32a19c4bd1 |
16710134156241 has 8 divisors (see below), whose sum is σ = 23048460905280. Its totient is φ = 10755948422352.
The previous prime is 16710134156231. The next prime is 16710134156267. The reversal of 16710134156241 is 14265143101761.
16710134156241 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 16710134156241 - 213 = 16710134148049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16710134156193 and 16710134156202.
It is not an unprimeable number, because it can be changed into a prime (16710134156231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96035253685 + ... + 96035253858.
It is an arithmetic number, because the mean of its divisors is an integer number (2881057613160).
Almost surely, 216710134156241 is an apocalyptic number.
It is an amenable number.
16710134156241 is a deficient number, since it is larger than the sum of its proper divisors (6338326749039).
16710134156241 is a wasteful number, since it uses less digits than its factorization.
16710134156241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192070507575.
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 16710134156241 in words is "sixteen trillion, seven hundred ten billion, one hundred thirty-four million, one hundred fifty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •