Base | Representation |
---|---|
bin | 11111111011110100010110… |
… | …100100110111101001001110 |
3 | 200102021220021020220121010011 |
4 | 133323310112210313221032 |
5 | 121402113303200412400 |
6 | 1214413515344303434 |
7 | 41404120341556462 |
oct | 3773642644675116 |
9 | 612256236817104 |
10 | 140450104310350 |
11 | 4082a6113a159a |
12 | 13904207911b7a |
13 | 604a5075b1153 |
14 | 2697b6d9b44a2 |
15 | 11386699d18ba |
hex | 7fbd16937a4e |
140450104310350 has 48 divisors (see below), whose sum is σ = 267731271601920. Its totient is φ = 54800601804000.
The previous prime is 140450104310183. The next prime is 140450104310357. The reversal of 140450104310350 is 53013401054041.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140450104310357) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 213870876 + ... + 214526575.
It is an arithmetic number, because the mean of its divisors is an integer number (5577734825040).
Almost surely, 2140450104310350 is an apocalyptic number.
140450104310350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140450104310350 is a deficient number, since it is larger than the sum of its proper divisors (127281167291570).
140450104310350 is a wasteful number, since it uses less digits than its factorization.
140450104310350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428397625 (or 428397620 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 140450104310350 its reverse (53013401054041), we get a palindrome (193463505364391).
The spelling of 140450104310350 in words is "one hundred forty trillion, four hundred fifty billion, one hundred four million, three hundred ten thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •