Base | Representation |
---|---|
bin | 11011100101001001101110… |
… | …011111110100110100101100 |
3 | 120220111012022212122212000101 |
4 | 123211021232133310310230 |
5 | 111344341023433211340 |
6 | 1105552333043440444 |
7 | 34356442004461204 |
oct | 3345115637646454 |
9 | 526435285585011 |
10 | 121300320210220 |
11 | 357171a4514048 |
12 | 11730993986124 |
13 | 528b756979bc8 |
14 | 21d4d76d6d404 |
15 | e0547672cc9a |
hex | 6e526e7f4d2c |
121300320210220 has 24 divisors (see below), whose sum is σ = 254730897759744. Its totient is φ = 48520085166336.
The previous prime is 121300320210191. The next prime is 121300320210229. The reversal of 121300320210220 is 22012023003121.
It is not an unprimeable number, because it can be changed into a prime (121300320210229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30513844 + ... + 34259236.
It is an arithmetic number, because the mean of its divisors is an integer number (10613787406656).
Almost surely, 2121300320210220 is an apocalyptic number.
121300320210220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121300320210220 is an abundant number, since it is smaller than the sum of its proper divisors (133430577549524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121300320210220 is a wasteful number, since it uses less digits than its factorization.
121300320210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5364729 (or 5364727 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 121300320210220 its reverse (22012023003121), we get a palindrome (143312343213341).
The spelling of 121300320210220 in words is "one hundred twenty-one trillion, three hundred billion, three hundred twenty million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •