Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0100110010000001001 |
3 | 100200020120222110121122 |
4 | 1132100222212100021 |
5 | 3124240100134031 |
6 | 114255034045025 |
7 | 10212053066315 |
oct | 1362052462011 |
9 | 320216873548 |
10 | 101211333641 |
11 | 39a18182a90 |
12 | 17747579775 |
13 | 970c771802 |
14 | 4c81ca0b45 |
15 | 297576347b |
hex | 1790aa6409 |
101211333641 has 8 divisors (see below), whose sum is σ = 115212901824. Its totient is φ = 88009855120.
The previous prime is 101211333617. The next prime is 101211333673. The reversal of 101211333641 is 146333112101.
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-101211333641 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101211333641.
It is not an unprimeable number, because it can be changed into a prime (101211333341) 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, 200022146 + ... + 200022651.
It is an arithmetic number, because the mean of its divisors is an integer number (14401612728).
Almost surely, 2101211333641 is an apocalyptic number.
101211333641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101211333641 is a deficient number, since it is larger than the sum of its proper divisors (14001568183).
101211333641 is a wasteful number, since it uses less digits than its factorization.
101211333641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400044831.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 101211333641 its reverse (146333112101), we get a palindrome (247544445742).
The spelling of 101211333641 in words is "one hundred one billion, two hundred eleven million, three hundred thirty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •