Base | Representation |
---|---|
bin | 101111000010011011… |
… | …0100101100111010001 |
3 | 100122201210001200222202 |
4 | 1132010312211213101 |
5 | 3123333331301121 |
6 | 114223234212545 |
7 | 10204125416030 |
oct | 1360466454721 |
9 | 318653050882 |
10 | 101013150161 |
11 | 39926320890 |
12 | 176b1124155 |
13 | 96aa6a2291 |
14 | 4c63832717 |
15 | 296316740b |
hex | 1784da59d1 |
101013150161 has 16 divisors (see below), whose sum is σ = 128867278848. Its totient is φ = 76881042000.
The previous prime is 101013150149. The next prime is 101013150163. The reversal of 101013150161 is 161051310101.
It is not a de Polignac number, because 101013150161 - 234 = 83833280977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101013150163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15250865 + ... + 15257486.
It is an arithmetic number, because the mean of its divisors is an integer number (8054204928).
Almost surely, 2101013150161 is an apocalyptic number.
101013150161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101013150161 is a deficient number, since it is larger than the sum of its proper divisors (27854128687).
101013150161 is a wasteful number, since it uses less digits than its factorization.
101013150161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30508412.
The product of its (nonzero) digits is 90, while the sum is 20.
Adding to 101013150161 its reverse (161051310101), we get a palindrome (262064460262).
The spelling of 101013150161 in words is "one hundred one billion, thirteen million, one hundred fifty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •