Base | Representation |
---|---|
bin | 101111001111001011… |
… | …1001101011100101011 |
3 | 100200211121101110011020 |
4 | 1132132113031130223 |
5 | 3130222412213311 |
6 | 114333523303523 |
7 | 10220543253330 |
oct | 1363627153453 |
9 | 320747343136 |
10 | 101441132331 |
11 | 3a025969160 |
12 | 177b051aba3 |
13 | 9748260276 |
14 | 4ca45dc987 |
15 | 298aa06c06 |
hex | 179e5cd72b |
101441132331 has 64 divisors (see below), whose sum is σ = 169366388736. Its totient is φ = 52467004800.
The previous prime is 101441132329. The next prime is 101441132413. The reversal of 101441132331 is 133231144101.
It is a happy number.
It is not a de Polignac number, because 101441132331 - 21 = 101441132329 is a prime.
It is a super-2 number, since 2×1014411323312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101441132131) 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 63 ways as a sum of consecutive naturals, for example, 68959926 + ... + 68961396.
It is an arithmetic number, because the mean of its divisors is an integer number (2646349824).
Almost surely, 2101441132331 is an apocalyptic number.
101441132331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101441132331 is a deficient number, since it is larger than the sum of its proper divisors (67925256405).
101441132331 is a wasteful number, since it uses less digits than its factorization.
101441132331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2592.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 101441132331 its reverse (133231144101), we get a palindrome (234672276432).
The spelling of 101441132331 in words is "one hundred one billion, four hundred forty-one million, one hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •