Base | Representation |
---|---|
bin | 101111000011100100… |
… | …1010110000011110101 |
3 | 100122211110110020220122 |
4 | 1132013021112003311 |
5 | 3123423203342441 |
6 | 114231130541325 |
7 | 10205103416516 |
oct | 1360711260365 |
9 | 318743406818 |
10 | 101051621621 |
11 | 39946007a85 |
12 | 17701b97845 |
13 | 96b5652162 |
14 | 4c689a8a0d |
15 | 296671634b |
hex | 17872560f5 |
101051621621 has 8 divisors (see below), whose sum is σ = 103282005600. Its totient is φ = 98839747440.
The previous prime is 101051621617. The next prime is 101051621639. The reversal of 101051621621 is 126126150101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101051621621 - 22 = 101051621617 is a prime.
It is a super-2 number, since 2×1010516216212 (a number of 23 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 (101051521621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4616411 + ... + 4638248.
It is an arithmetic number, because the mean of its divisors is an integer number (12910250700).
Almost surely, 2101051621621 is an apocalyptic number.
It is an amenable number.
101051621621 is a deficient number, since it is larger than the sum of its proper divisors (2230383979).
101051621621 is an equidigital number, since it uses as much as digits as its factorization.
101051621621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9254899.
The product of its (nonzero) digits is 720, while the sum is 26.
Adding to 101051621621 its reverse (126126150101), we get a palindrome (227177771722).
The spelling of 101051621621 in words is "one hundred one billion, fifty-one million, six hundred twenty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •