Base | Representation |
---|---|
bin | 10110110011100110101001… |
… | …011000110101011000011101 |
3 | 111011010220010101022010022010 |
4 | 112303212221120311120131 |
5 | 101121331440024414401 |
6 | 553154354320141433 |
7 | 30061445061152502 |
oct | 2663465130653035 |
9 | 434126111263263 |
10 | 100303213123101 |
11 | 29a613989aa40a |
12 | b2bb527167879 |
13 | 43c7724859611 |
14 | 1aaa9b69974a9 |
15 | b8e1b40beed6 |
hex | 5b39a963561d |
100303213123101 has 8 divisors (see below), whose sum is σ = 133740508619104. Its totient is φ = 66867363187920.
The previous prime is 100303213123039. The next prime is 100303213123123. The reversal of 100303213123101 is 101321312303001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-100303213123101 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 (100303213123801) 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, 361228291 + ... + 361505856.
It is an arithmetic number, because the mean of its divisors is an integer number (16717563577388).
Almost surely, 2100303213123101 is an apocalyptic number.
It is an amenable number.
100303213123101 is a deficient number, since it is larger than the sum of its proper divisors (33437295496003).
100303213123101 is an equidigital number, since it uses as much as digits as its factorization.
100303213123101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722780411.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 100303213123101 its reverse (101321312303001), we get a palindrome (201624525426102).
The spelling of 100303213123101 in words is "one hundred trillion, three hundred three billion, two hundred thirteen million, one hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •