Base | Representation |
---|---|
bin | 10110111111101011100100… |
… | …011011001111111011101101 |
3 | 111021002020021212122112020011 |
4 | 112333223210123033323231 |
5 | 101223431123332100023 |
6 | 555031530344253221 |
7 | 30205425203601532 |
oct | 2677534433177355 |
9 | 437066255575204 |
10 | 101133132300013 |
11 | 2a2513587145a0 |
12 | b414341471211 |
13 | 4457a76210168 |
14 | 1ad8c26728d89 |
15 | ba5a88d7350d |
hex | 5bfae46cfeed |
101133132300013 has 8 divisors (see below), whose sum is σ = 111120773228640. Its totient is φ = 91277778006480.
The previous prime is 101133132299923. The next prime is 101133132300023. The reversal of 101133132300013 is 310003231331101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101133132300013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101133132300023) 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, 33071657170 + ... + 33071660227.
It is an arithmetic number, because the mean of its divisors is an integer number (13890096653580).
Almost surely, 2101133132300013 is an apocalyptic number.
It is an amenable number.
101133132300013 is a deficient number, since it is larger than the sum of its proper divisors (9987640928627).
101133132300013 is a wasteful number, since it uses less digits than its factorization.
101133132300013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66143317547.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 101133132300013 its reverse (310003231331101), we get a palindrome (411136363631114).
The spelling of 101133132300013 in words is "one hundred one trillion, one hundred thirty-three billion, one hundred thirty-two million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •