Base | Representation |
---|---|
bin | 11111111011110100100100… |
… | …000011011000000010010011 |
3 | 200102021220212000100201010001 |
4 | 133323310210003120002103 |
5 | 121402114234041124110 |
6 | 1214413554022350431 |
7 | 41404126055442502 |
oct | 3773644403300223 |
9 | 612256760321101 |
10 | 140450330411155 |
11 | 4082a717a91466 |
12 | 1390426b58b417 |
13 | 604a5423a66cb |
14 | 2697b91a2c839 |
15 | 113867e79463a |
hex | 7fbd240d8093 |
140450330411155 has 32 divisors (see below), whose sum is σ = 174345758705664. Its totient is φ = 108558408971136.
The previous prime is 140450330411143. The next prime is 140450330411177. The reversal of 140450330411155 is 551114033054041.
It is a cyclic number.
It is not a de Polignac number, because 140450330411155 - 211 = 140450330409107 is a prime.
It is a super-2 number, since 2×1404503304111552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1479277 + ... + 16825246.
It is an arithmetic number, because the mean of its divisors is an integer number (5448304959552).
Almost surely, 2140450330411155 is an apocalyptic number.
140450330411155 is a deficient number, since it is larger than the sum of its proper divisors (33895428294509).
140450330411155 is a wasteful number, since it uses less digits than its factorization.
140450330411155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18304995.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 140450330411155 its reverse (551114033054041), we get a palindrome (691564363465196).
The spelling of 140450330411155 in words is "one hundred forty trillion, four hundred fifty billion, three hundred thirty million, four hundred eleven thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •