Base | Representation |
---|---|
bin | 11111111000100111110010… |
… | …001010111101000101110101 |
3 | 200101111220022011221220200122 |
4 | 133320213302022331011311 |
5 | 121340013430223030140 |
6 | 1214124551322421325 |
7 | 41352213165514064 |
oct | 3770476212750565 |
9 | 611456264856618 |
10 | 140230450205045 |
11 | 40755444382162 |
12 | 13889726061845 |
13 | 60328a0463a85 |
14 | 268b29352a1db |
15 | 1132ab0d68ab5 |
hex | 7f89f22bd175 |
140230450205045 has 4 divisors (see below), whose sum is σ = 168276540246060. Its totient is φ = 112184360164032.
The previous prime is 140230450204963. The next prime is 140230450205063. The reversal of 140230450205045 is 540502054032041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25641432405169 + 114589017799876 = 5063737^2 + 10704626^2 .
It is a cyclic number.
It is not a de Polignac number, because 140230450205045 - 212 = 140230450200949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140230450204996 and 140230450205014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14023045020500 + ... + 14023045020509.
It is an arithmetic number, because the mean of its divisors is an integer number (42069135061515).
Almost surely, 2140230450205045 is an apocalyptic number.
It is an amenable number.
140230450205045 is a deficient number, since it is larger than the sum of its proper divisors (28046090041015).
140230450205045 is an equidigital number, since it uses as much as digits as its factorization.
140230450205045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28046090041014.
The product of its (nonzero) digits is 96000, while the sum is 35.
The spelling of 140230450205045 in words is "one hundred forty trillion, two hundred thirty billion, four hundred fifty million, two hundred five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •