Base | Representation |
---|---|
bin | 1000001101101101101… |
… | …1101001110110101111 |
3 | 111111020220221202120210 |
4 | 2003123123221312233 |
5 | 4303003311204403 |
6 | 144455124113503 |
7 | 13124044501545 |
oct | 2033333516657 |
9 | 444226852523 |
10 | 141120413103 |
11 | 5493788108a |
12 | 23424b35893 |
13 | 103cca3c127 |
14 | 6b8a361d95 |
15 | 3a0e28ab03 |
hex | 20db6e9daf |
141120413103 has 16 divisors (see below), whose sum is σ = 195574248576. Its totient is φ = 90434697120.
The previous prime is 141120413099. The next prime is 141120413111. The reversal of 141120413103 is 301314021141.
It is not a de Polignac number, because 141120413103 - 22 = 141120413099 is a prime.
It is a super-2 number, since 2×1411204131032 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 141120413103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141120413003) 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 15 ways as a sum of consecutive naturals, for example, 7649553 + ... + 7667978.
It is an arithmetic number, because the mean of its divisors is an integer number (12223390536).
Almost surely, 2141120413103 is an apocalyptic number.
141120413103 is a deficient number, since it is larger than the sum of its proper divisors (54453835473).
141120413103 is a wasteful number, since it uses less digits than its factorization.
141120413103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15317654.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 141120413103 its reverse (301314021141), we get a palindrome (442434434244).
The spelling of 141120413103 in words is "one hundred forty-one billion, one hundred twenty million, four hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •