Base | Representation |
---|---|
bin | 100000000101010010100100… |
… | …010111011110000100100101 |
3 | 200111121010101220200110220212 |
4 | 200011102210113132010211 |
5 | 121443244343421132401 |
6 | 1220032525403505205 |
7 | 41502132615212213 |
oct | 4005224427360445 |
9 | 614533356613825 |
10 | 141101023224101 |
11 | 40a60676128696 |
12 | 139aa3a7228205 |
13 | 6096a00497905 |
14 | 26bb47c629cb3 |
15 | 114a564c09dbb |
hex | 8054a45de125 |
141101023224101 has 32 divisors (see below), whose sum is σ = 154742625037440. Its totient is φ = 128064270329856.
The previous prime is 141101023224097. The next prime is 141101023224107. The reversal of 141101023224101 is 101422320101141.
It is a cyclic number.
It is not a de Polignac number, because 141101023224101 - 22 = 141101023224097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141101023224107) 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 31 ways as a sum of consecutive naturals, for example, 1329044846 + ... + 1329151008.
It is an arithmetic number, because the mean of its divisors is an integer number (4835707032420).
Almost surely, 2141101023224101 is an apocalyptic number.
It is an amenable number.
141101023224101 is a deficient number, since it is larger than the sum of its proper divisors (13641601813339).
141101023224101 is a wasteful number, since it uses less digits than its factorization.
141101023224101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109493.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 141101023224101 its reverse (101422320101141), we get a palindrome (242523343325242).
The spelling of 141101023224101 in words is "one hundred forty-one trillion, one hundred one billion, twenty-three million, two hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •