Base | Representation |
---|---|
bin | 11011010101100110000011… |
… | …001010010000001111111101 |
3 | 120202200222210110001001221002 |
4 | 123111212003022100033331 |
5 | 111224332014311121341 |
6 | 1103413243204220045 |
7 | 34216263500010242 |
oct | 3325460312201775 |
9 | 522628713031832 |
10 | 120231220020221 |
11 | 35344857309712 |
12 | 1159974839a625 |
13 | 52119a87c4a9b |
14 | 219931761b5c9 |
15 | dd775389629b |
hex | 6d59832903fd |
120231220020221 has 32 divisors (see below), whose sum is σ = 125172732174336. Its totient is φ = 115405202304000.
The previous prime is 120231220020203. The next prime is 120231220020251. The reversal of 120231220020221 is 122020022132021.
It is a cyclic number.
It is not a de Polignac number, because 120231220020221 - 218 = 120231219758077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120231220020193 and 120231220020202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120231220020251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 290534771 + ... + 290948303.
It is an arithmetic number, because the mean of its divisors is an integer number (3911647880448).
Almost surely, 2120231220020221 is an apocalyptic number.
It is an amenable number.
120231220020221 is a deficient number, since it is larger than the sum of its proper divisors (4941512154115).
120231220020221 is a wasteful number, since it uses less digits than its factorization.
120231220020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414173.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 120231220020221 its reverse (122020022132021), we get a palindrome (242251242152242).
The spelling of 120231220020221 in words is "one hundred twenty trillion, two hundred thirty-one billion, two hundred twenty million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •