Base | Representation |
---|---|
bin | 1011000001011111010011… |
… | …0100000001111011101000 |
3 | 1120220200101021102221110221 |
4 | 2300113310310001323220 |
5 | 3042034142231201440 |
6 | 41435540404015424 |
7 | 2360441050233214 |
oct | 260276464017350 |
9 | 46820337387427 |
10 | 12120210022120 |
11 | 3953174647722 |
12 | 1438b89991574 |
13 | 69bc1425cba5 |
14 | 2dc89ab95944 |
15 | 16041b55ed4a |
hex | b05f4d01ee8 |
12120210022120 has 32 divisors (see below), whose sum is σ = 27576882361800. Its totient is φ = 4793611153408.
The previous prime is 12120210022111. The next prime is 12120210022147. The reversal of 12120210022120 is 2122001202121.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 5663152948644 + 6457057073476 = 2379738^2 + 2541074^2 .
It is a junction number, because it is equal to n+sod(n) for n = 12120210022094 and 12120210022103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1702273129 + ... + 1702280248.
Almost surely, 212120210022120 is an apocalyptic number.
12120210022120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12120210022120 is an abundant number, since it is smaller than the sum of its proper divisors (15456672339680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12120210022120 is a wasteful number, since it uses less digits than its factorization.
12120210022120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3404553477 (or 3404553473 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12120210022120 its reverse (2122001202121), we get a palindrome (14242211224241).
The spelling of 12120210022120 in words is "twelve trillion, one hundred twenty billion, two hundred ten million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •