Base | Representation |
---|---|
bin | 10110111110101000011110… |
… | …111110001101100111010011 |
3 | 111020211100100211100122002022 |
4 | 112332220132332031213103 |
5 | 101221241113111200201 |
6 | 554534454540242055 |
7 | 30200265162156620 |
oct | 2676503676154723 |
9 | 436740324318068 |
10 | 101061100100051 |
11 | 2a223854392623 |
12 | b402399b4032b |
13 | 4451036a56030 |
14 | 1ad5551c75347 |
15 | ba3c7013e41b |
hex | 5bea1ef8d9d3 |
101061100100051 has 32 divisors (see below), whose sum is σ = 124577487390720. Its totient is φ = 79835426810496.
The previous prime is 101061100100003. The next prime is 101061100100101. The reversal of 101061100100051 is 150001001160101.
It is not a de Polignac number, because 101061100100051 - 26 = 101061100099987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101061100100251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 157292585 + ... + 157933781.
It is an arithmetic number, because the mean of its divisors is an integer number (3893046480960).
Almost surely, 2101061100100051 is an apocalyptic number.
101061100100051 is a deficient number, since it is larger than the sum of its proper divisors (23516387290669).
101061100100051 is a wasteful number, since it uses less digits than its factorization.
101061100100051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 643923.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 101061100100051 its reverse (150001001160101), we get a palindrome (251062101260152).
The spelling of 101061100100051 in words is "one hundred one trillion, sixty-one billion, one hundred million, one hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •