Base | Representation |
---|---|
bin | 11011010101011011110011… |
… | …101000111110111011000100 |
3 | 120202122221101222202000222210 |
4 | 123111123303220332323010 |
5 | 111224142003342101040 |
6 | 1103404224015223420 |
7 | 34215424115164524 |
oct | 3325336350767304 |
9 | 522587358660883 |
10 | 120220222222020 |
11 | 35340123345098 |
12 | 11597599217b70 |
13 | 521094518b69b |
14 | 2198992b61684 |
15 | dd730d0de480 |
hex | 6d56f3a3eec4 |
120220222222020 has 48 divisors (see below), whose sum is σ = 336657820097088. Its totient is φ = 32054802318720.
The previous prime is 120220222222007. The next prime is 120220222222129. The reversal of 120220222222020 is 20222222022021.
It is a super-2 number, since 2×1202202222220202 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 122118379 + ... + 123098898.
It is an arithmetic number, because the mean of its divisors is an integer number (7013704585356).
Almost surely, 2120220222222020 is an apocalyptic number.
120220222222020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120220222222020 is an abundant number, since it is smaller than the sum of its proper divisors (216437597875068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120220222222020 is a wasteful number, since it uses less digits than its factorization.
120220222222020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245225460 (or 245225458 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 21.
Adding to 120220222222020 its reverse (20222222022021), we get a palindrome (140442444244041).
The spelling of 120220222222020 in words is "one hundred twenty trillion, two hundred twenty billion, two hundred twenty-two million, two hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •