Base | Representation |
---|---|
bin | 11011010101011101100000… |
… | …000000000110100101000101 |
3 | 120202200010002200122000011011 |
4 | 123111131200000012211011 |
5 | 111224204214244101041 |
6 | 1103405124241242221 |
7 | 34215520142011213 |
oct | 3325354000064505 |
9 | 522603080560134 |
10 | 120222040222021 |
11 | 35340976583431 |
12 | 11597a06033371 |
13 | 5210b74a1172a |
14 | 2198ac63a1cb3 |
15 | dd73b7a00e81 |
hex | 6d5760006945 |
120222040222021 has 16 divisors (see below), whose sum is σ = 128023977476160. Its totient is φ = 112571457868800.
The previous prime is 120222040221967. The next prime is 120222040222069.
120222040222021 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 120222040222021 - 27 = 120222040221893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120222040221983 and 120222040222001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120222040222121) 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 15 ways as a sum of consecutive naturals, for example, 53180671 + ... + 55395196.
It is an arithmetic number, because the mean of its divisors is an integer number (8001498592260).
Almost surely, 2120222040222021 is an apocalyptic number.
It is an amenable number.
120222040222021 is a deficient number, since it is larger than the sum of its proper divisors (7801937254139).
120222040222021 is a wasteful number, since it uses less digits than its factorization.
120222040222021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108576564.
The product of its (nonzero) digits is 1024, while the sum is 22.
The spelling of 120222040222021 in words is "one hundred twenty trillion, two hundred twenty-two billion, forty million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •