Base | Representation |
---|---|
bin | 101111000010111101… |
… | …1100100011001100001 |
3 | 100122210001002102011000 |
4 | 1132011323210121201 |
5 | 3123402443424441 |
6 | 114225121542213 |
7 | 10204435212030 |
oct | 1360573443141 |
9 | 318701072130 |
10 | 101031233121 |
11 | 39935551885 |
12 | 176b71a4969 |
13 | 96b1363c60 |
14 | 4c65dbc717 |
15 | 2964a3a2b6 |
hex | 1785ee4661 |
101031233121 has 128 divisors (see below), whose sum is σ = 195319434240. Its totient is φ = 50087890944.
The previous prime is 101031233057. The next prime is 101031233143. The reversal of 101031233121 is 121332130101.
101031233121 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 312 + 331 + 21 = 666.
It is not a de Polignac number, because 101031233121 - 26 = 101031233057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101031233094 and 101031233103.
It is not an unprimeable number, because it can be changed into a prime (101031223121) 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 127 ways as a sum of consecutive naturals, for example, 45652411 + ... + 45654623.
It is an arithmetic number, because the mean of its divisors is an integer number (1525933080).
Almost surely, 2101031233121 is an apocalyptic number.
It is an amenable number.
101031233121 is a deficient number, since it is larger than the sum of its proper divisors (94288201119).
101031233121 is a wasteful number, since it uses less digits than its factorization.
101031233121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3352 (or 3346 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 101031233121 its reverse (121332130101), we get a palindrome (222363363222).
The spelling of 101031233121 in words is "one hundred one billion, thirty-one million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •