Base | Representation |
---|---|
bin | 1111000110010011101010… |
… | …0000001000010010100101 |
3 | 2011210001011022221100221121 |
4 | 3301210322200020102211 |
5 | 4133442402201201013 |
6 | 55150224041013541 |
7 | 3332246000411053 |
oct | 361447240102245 |
9 | 64701138840847 |
10 | 16601030100133 |
11 | 5320503781496 |
12 | 1a414834842b1 |
13 | 93561669140b |
14 | 4156cbd071d3 |
15 | 1dbc6e3c358d |
hex | f193a8084a5 |
16601030100133 has 2 divisors, whose sum is σ = 16601030100134. Its totient is φ = 16601030100132.
The previous prime is 16601030100121. The next prime is 16601030100157. The reversal of 16601030100133 is 33100103010661.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8710425503649 + 7890604596484 = 2951343^2 + 2809022^2 .
It is a cyclic number.
It is not a de Polignac number, because 16601030100133 - 25 = 16601030100101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16601030100098 and 16601030100107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16601030100233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8300515050066 + 8300515050067.
It is an arithmetic number, because the mean of its divisors is an integer number (8300515050067).
Almost surely, 216601030100133 is an apocalyptic number.
It is an amenable number.
16601030100133 is a deficient number, since it is larger than the sum of its proper divisors (1).
16601030100133 is an equidigital number, since it uses as much as digits as its factorization.
16601030100133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 16601030100133 its reverse (33100103010661), we get a palindrome (49701133110794).
The spelling of 16601030100133 in words is "sixteen trillion, six hundred one billion, thirty million, one hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •