Base | Representation |
---|---|
bin | 1011001101110000111100… |
… | …0000111100010100000101 |
3 | 1121122211201202210212001201 |
4 | 2303130033000330110011 |
5 | 3104013044332341401 |
6 | 42120455220422501 |
7 | 2411615141123416 |
oct | 263341700742405 |
9 | 47584652725051 |
10 | 12331103012101 |
11 | 3a246561a7485 |
12 | 1471a25547a31 |
13 | 6b5a8327a263 |
14 | 308b8584d80d |
15 | 165b60e86b01 |
hex | b370f03c505 |
12331103012101 has 8 divisors (see below), whose sum is σ = 12341778134400. Its totient is φ = 12320428459872.
The previous prime is 12331103012047. The next prime is 12331103012119. The reversal of 12331103012101 is 10121030113321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12331103012101 - 27 = 12331103011973 is a prime.
It is a super-2 number, since 2×123311030121012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12331103012201) 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, 51058036 + ... + 51298978.
It is an arithmetic number, because the mean of its divisors is an integer number (1542722266800).
Almost surely, 212331103012101 is an apocalyptic number.
It is an amenable number.
12331103012101 is a deficient number, since it is larger than the sum of its proper divisors (10675122299).
12331103012101 is a wasteful number, since it uses less digits than its factorization.
12331103012101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285035.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 12331103012101 its reverse (10121030113321), we get a palindrome (22452133125422).
The spelling of 12331103012101 in words is "twelve trillion, three hundred thirty-one billion, one hundred three million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •