Base | Representation |
---|---|
bin | 10101000110100111011… |
… | …000100101110001001010 |
3 | 12010122020210010212011220 |
4 | 111012213120211301022 |
5 | 142230013312014403 |
6 | 3030115052502510 |
7 | 206526416323644 |
oct | 25064730456112 |
9 | 5118223125156 |
10 | 1450212219978 |
11 | 50a038a9a355 |
12 | 1b508917aa36 |
13 | a69a661c042 |
14 | 502951bd894 |
15 | 27acb474953 |
hex | 151a7625c4a |
1450212219978 has 8 divisors (see below), whose sum is σ = 2900424439968. Its totient is φ = 483404073324.
The previous prime is 1450212219961. The next prime is 1450212219979. The reversal of 1450212219978 is 8799122120541.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1450212219978 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 1450212219978.
It is not an unprimeable number, because it can be changed into a prime (1450212219979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 120851018326 + ... + 120851018337.
It is an arithmetic number, because the mean of its divisors is an integer number (362553054996).
Almost surely, 21450212219978 is an apocalyptic number.
1450212219978 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1450212219978 is a wasteful number, since it uses less digits than its factorization.
1450212219978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241702036668.
The product of its (nonzero) digits is 725760, while the sum is 51.
The spelling of 1450212219978 in words is "one trillion, four hundred fifty billion, two hundred twelve million, two hundred nineteen thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •