Base | Representation |
---|---|
bin | 10111000000110100010111… |
… | …100101110010001111100100 |
3 | 111021100201001112011202212002 |
4 | 113000310113211302033210 |
5 | 101231221220312030312 |
6 | 555131455051544432 |
7 | 30214163240203265 |
oct | 2700642745621744 |
9 | 437321045152762 |
10 | 101211300111332 |
11 | 2a281520381154 |
12 | b42751775b118 |
13 | 4462252894958 |
14 | 1adc92000c96c |
15 | ba7b1157b4c2 |
hex | 5c0d179723e4 |
101211300111332 has 12 divisors (see below), whose sum is σ = 177395233636656. Its totient is φ = 50526947643720.
The previous prime is 101211300111331. The next prime is 101211300111413. The reversal of 101211300111332 is 233111003112101.
It is a super-2 number, since 2×1012113001113322 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101211300111331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19675600094 + ... + 19675605237.
It is an arithmetic number, because the mean of its divisors is an integer number (14782936136388).
Almost surely, 2101211300111332 is an apocalyptic number.
It is an amenable number.
101211300111332 is a deficient number, since it is larger than the sum of its proper divisors (76183933525324).
101211300111332 is a wasteful number, since it uses less digits than its factorization.
101211300111332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39351205978 (or 39351205976 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 101211300111332 its reverse (233111003112101), we get a palindrome (334322303223433).
The spelling of 101211300111332 in words is "one hundred one trillion, two hundred eleven billion, three hundred million, one hundred eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •