Base | Representation |
---|---|
bin | 11111111000100010010001… |
… | …111101101101111011000111 |
3 | 200101111100001101001001220211 |
4 | 133320202101331231323013 |
5 | 121334414330013430030 |
6 | 1214122133115140251 |
7 | 41351613564436012 |
oct | 3770422175557307 |
9 | 611440041031824 |
10 | 140224541155015 |
11 | 40752991921439 |
12 | 13888557144687 |
13 | 603216b190475 |
14 | 268ac92834379 |
15 | 11328671e912a |
hex | 7f8891f6dec7 |
140224541155015 has 4 divisors (see below), whose sum is σ = 168269449386024. Its totient is φ = 112179632924008.
The previous prime is 140224541155001. The next prime is 140224541155051. The reversal of 140224541155015 is 510551145422041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140224541155015 - 227 = 140224406937287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14022454115497 + ... + 14022454115506.
It is an arithmetic number, because the mean of its divisors is an integer number (42067362346506).
Almost surely, 2140224541155015 is an apocalyptic number.
140224541155015 is a deficient number, since it is larger than the sum of its proper divisors (28044908231009).
140224541155015 is an equidigital number, since it uses as much as digits as its factorization.
140224541155015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28044908231008.
The product of its (nonzero) digits is 160000, while the sum is 40.
Adding to 140224541155015 its reverse (510551145422041), we get a palindrome (650775686577056).
The spelling of 140224541155015 in words is "one hundred forty trillion, two hundred twenty-four billion, five hundred forty-one million, one hundred fifty-five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.546 sec. • engine limits •