Base | Representation |
---|---|
bin | 101110100110000011… |
… | …0110011111110001011 |
3 | 100120021102121122101101 |
4 | 1131030012303332023 |
5 | 3114411120230323 |
6 | 113544544402231 |
7 | 10141415222224 |
oct | 1351406637613 |
9 | 316242548341 |
10 | 100061101963 |
11 | 39487979999 |
12 | 17486316377 |
13 | 9588384154 |
14 | 4bb320824b |
15 | 29097a8dad |
hex | 174c1b3f8b |
100061101963 has 2 divisors, whose sum is σ = 100061101964. Its totient is φ = 100061101962.
The previous prime is 100061101951. The next prime is 100061101967. The reversal of 100061101963 is 369101160001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100061101963 - 213 = 100061093771 is a prime.
It is not a weakly prime, because it can be changed into another prime (100061101967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50030550981 + 50030550982.
It is an arithmetic number, because the mean of its divisors is an integer number (50030550982).
Almost surely, 2100061101963 is an apocalyptic number.
100061101963 is a deficient number, since it is larger than the sum of its proper divisors (1).
100061101963 is an equidigital number, since it uses as much as digits as its factorization.
100061101963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
Adding to 100061101963 its reverse (369101160001), we get a palindrome (469162261964).
The spelling of 100061101963 in words is "one hundred billion, sixty-one million, one hundred one thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •