Base | Representation |
---|---|
bin | 101111001110000101… |
… | …0011000010010101001 |
3 | 100200202000220211022222 |
4 | 1132130022120102221 |
5 | 3130133434330231 |
6 | 114330124123425 |
7 | 10216614413105 |
oct | 1363412302251 |
9 | 320660824288 |
10 | 101404214441 |
11 | 3a007043202 |
12 | 177a0096575 |
13 | 974070556a |
14 | 4c9d74c905 |
15 | 298766327b |
hex | 179c2984a9 |
101404214441 has 8 divisors (see below), whose sum is σ = 103130768160. Its totient is φ = 99677922112.
The previous prime is 101404214407. The next prime is 101404214449. The reversal of 101404214441 is 144412404101.
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 101404214441 - 214 = 101404198057 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 101404214441.
It is not an unprimeable number, because it can be changed into a prime (101404214449) 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, 817841 + ... + 933633.
It is an arithmetic number, because the mean of its divisors is an integer number (12891346020).
Almost surely, 2101404214441 is an apocalyptic number.
It is an amenable number.
101404214441 is a deficient number, since it is larger than the sum of its proper divisors (1726553719).
101404214441 is a wasteful number, since it uses less digits than its factorization.
101404214441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130695.
The product of its (nonzero) digits is 2048, while the sum is 26.
Adding to 101404214441 its reverse (144412404101), we get a palindrome (245816618542).
The spelling of 101404214441 in words is "one hundred one billion, four hundred four million, two hundred fourteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •