Base | Representation |
---|---|
bin | 10111000010100011110110… |
… | …010101010001101110110111 |
3 | 111021210011000200221010120001 |
4 | 113002203312111101232313 |
5 | 101240201342303020043 |
6 | 555302452550052131 |
7 | 30225631446634411 |
oct | 2702436625215667 |
9 | 437704020833501 |
10 | 101331001220023 |
11 | 2a318266549863 |
12 | b44676334a047 |
13 | 447061ab7ba53 |
14 | 1b0463778d9b1 |
15 | baacba19174d |
hex | 5c28f6551bb7 |
101331001220023 has 16 divisors (see below), whose sum is σ = 102495454457760. Its totient is φ = 100171269689344.
The previous prime is 101331001219997. The next prime is 101331001220063. The reversal of 101331001220023 is 320022100133101.
It is a cyclic number.
It is not a de Polignac number, because 101331001220023 - 213 = 101331001211831 is a prime.
It is a super-3 number, since 3×1013310012200233 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101331001220063) 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, 1222095015 + ... + 1222177927.
It is an arithmetic number, because the mean of its divisors is an integer number (6405965903610).
Almost surely, 2101331001220023 is an apocalyptic number.
101331001220023 is a deficient number, since it is larger than the sum of its proper divisors (1164453237737).
101331001220023 is a wasteful number, since it uses less digits than its factorization.
101331001220023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111218.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 101331001220023 its reverse (320022100133101), we get a palindrome (421353101353124).
The spelling of 101331001220023 in words is "one hundred one trillion, three hundred thirty-one billion, one million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •