Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …111010100111101100010101 |
3 | 111020121201100202101000002101 |
4 | 112331301220322213230111 |
5 | 101214310012022131013 |
6 | 554451435241242101 |
7 | 30163111643164645 |
oct | 2675615072475425 |
9 | 436551322330071 |
10 | 101002211130133 |
11 | 2a200885073945 |
12 | b3b2aa4193331 |
13 | 444861053c1c1 |
14 | 1ad2766b92525 |
15 | ba24752008dd |
hex | 5bdc68ea7b15 |
101002211130133 has 16 divisors (see below), whose sum is σ = 103440757492800. Its totient is φ = 98589526922880.
The previous prime is 101002211130059. The next prime is 101002211130143. The reversal of 101002211130133 is 331031112200101.
It is a cyclic number.
It is not a de Polignac number, because 101002211130133 - 217 = 101002210999061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101002211130133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002211130143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17285985 + ... + 22378777.
It is an arithmetic number, because the mean of its divisors is an integer number (6465047343300).
Almost surely, 2101002211130133 is an apocalyptic number.
It is an amenable number.
101002211130133 is a deficient number, since it is larger than the sum of its proper divisors (2438546362667).
101002211130133 is a wasteful number, since it uses less digits than its factorization.
101002211130133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5095332.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 101002211130133 its reverse (331031112200101), we get a palindrome (432033323330234).
The spelling of 101002211130133 in words is "one hundred one trillion, two billion, two hundred eleven million, one hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •