Base | Representation |
---|---|
bin | 101111001000111011… |
… | …0000101000000111001 |
3 | 100200021222012202000002 |
4 | 1132101312011000321 |
5 | 3124310131323231 |
6 | 114301022122345 |
7 | 10212413216633 |
oct | 1362166050071 |
9 | 320258182002 |
10 | 101231120441 |
11 | 39a28368110 |
12 | 177521203b5 |
13 | 97138abb89 |
14 | 4c84771a53 |
15 | 29773710cb |
hex | 1791d85039 |
101231120441 has 8 divisors (see below), whose sum is σ = 110437976064. Its totient is φ = 92024935920.
The previous prime is 101231120437. The next prime is 101231120453. The reversal of 101231120441 is 144021132101.
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 101231120441 - 22 = 101231120437 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101231120411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178760 + ... + 484166.
It is an arithmetic number, because the mean of its divisors is an integer number (13804747008).
Almost surely, 2101231120441 is an apocalyptic number.
101231120441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101231120441 is a deficient number, since it is larger than the sum of its proper divisors (9206855623).
101231120441 is a wasteful number, since it uses less digits than its factorization.
101231120441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335551.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 101231120441 its reverse (144021132101), we get a palindrome (245252252542).
The spelling of 101231120441 in words is "one hundred one billion, two hundred thirty-one million, one hundred twenty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •