Base | Representation |
---|---|
bin | 11010000001010110101110… |
… | …100100011111001001000001 |
3 | 120000012120122220200200220201 |
4 | 122001112232210133021001 |
5 | 110000010344043332431 |
6 | 1043222025352205201 |
7 | 33051120453101224 |
oct | 3201265644371101 |
9 | 500176586620821 |
10 | 114442332402241 |
11 | 335127a2154558 |
12 | 10a03835699801 |
13 | 4bb1b33a6913c |
14 | 20390776b55bb |
15 | d36d93720461 |
hex | 6815ae91f241 |
114442332402241 has 16 divisors (see below), whose sum is σ = 116063506648960. Its totient is φ = 112831014268800.
The previous prime is 114442332402239. The next prime is 114442332402271. The reversal of 114442332402241 is 142204233244411.
It is a cyclic number.
It is not a de Polignac number, because 114442332402241 - 21 = 114442332402239 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 114442332402241.
It is not an unprimeable number, because it can be changed into a prime (114442332402271) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 556385266 + ... + 556590916.
It is an arithmetic number, because the mean of its divisors is an integer number (7253969165560).
Almost surely, 2114442332402241 is an apocalyptic number.
It is an amenable number.
114442332402241 is a deficient number, since it is larger than the sum of its proper divisors (1621174246719).
114442332402241 is a wasteful number, since it uses less digits than its factorization.
114442332402241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229576.
The product of its (nonzero) digits is 147456, while the sum is 37.
Adding to 114442332402241 its reverse (142204233244411), we get a palindrome (256646565646652).
The spelling of 114442332402241 in words is "one hundred fourteen trillion, four hundred forty-two billion, three hundred thirty-two million, four hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •