Base | Representation |
---|---|
bin | 10101000110100111011… |
… | …000100101110001110101 |
3 | 12010122020210010212020111 |
4 | 111012213120211301311 |
5 | 142230013312020041 |
6 | 3030115052503021 |
7 | 206526416324035 |
oct | 25064730456165 |
9 | 5118223125214 |
10 | 1450212220021 |
11 | 50a038a9a394 |
12 | 1b508917aa71 |
13 | a69a661c076 |
14 | 502951bd8c5 |
15 | 27acb474981 |
hex | 151a7625c75 |
1450212220021 has 16 divisors (see below), whose sum is σ = 1462852440000. Its totient is φ = 1437605554176.
The previous prime is 1450212219979. The next prime is 1450212220073. The reversal of 1450212220021 is 1200222120541.
It is a cyclic number.
It is not a de Polignac number, because 1450212220021 - 211 = 1450212217973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1450212219974 and 1450212220001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1450212220091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 350375370 + ... + 350379508.
It is an arithmetic number, because the mean of its divisors is an integer number (91428277500).
Almost surely, 21450212220021 is an apocalyptic number.
It is an amenable number.
1450212220021 is a deficient number, since it is larger than the sum of its proper divisors (12640219979).
1450212220021 is a wasteful number, since it uses less digits than its factorization.
1450212220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7476.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 1450212220021 its reverse (1200222120541), we get a palindrome (2650434340562).
The spelling of 1450212220021 in words is "one trillion, four hundred fifty billion, two hundred twelve million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •