Base | Representation |
---|---|
bin | 10111000000101100101001… |
… | …101001110110100111101011 |
3 | 111021022220122222221202001020 |
4 | 113000230221221312213223 |
5 | 101231102232341430011 |
6 | 555124004503223523 |
7 | 30213451003664445 |
oct | 2700545151664753 |
9 | 437286588852036 |
10 | 101203013233131 |
11 | 2a278a58681987 |
12 | b4259a4447ba3 |
13 | 4461531a99524 |
14 | 1adc3755c9495 |
15 | ba77c8cb5006 |
hex | 5c0b29a769eb |
101203013233131 has 8 divisors (see below), whose sum is σ = 139290168751104. Its totient is φ = 65292266601960.
The previous prime is 101203013233123. The next prime is 101203013233219. The reversal of 101203013233131 is 131332310302101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101203013233131 - 23 = 101203013233123 is a prime.
It is a super-2 number, since 2×1012030132331312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101203013233121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 544102221591 + ... + 544102221776.
It is an arithmetic number, because the mean of its divisors is an integer number (17411271093888).
Almost surely, 2101203013233131 is an apocalyptic number.
101203013233131 is a deficient number, since it is larger than the sum of its proper divisors (38087155517973).
101203013233131 is a wasteful number, since it uses less digits than its factorization.
101203013233131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088204443401.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 101203013233131 its reverse (131332310302101), we get a palindrome (232535323535232).
The spelling of 101203013233131 in words is "one hundred one trillion, two hundred three billion, thirteen million, two hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •