Base | Representation |
---|---|
bin | 11011100001000100110000… |
… | …110110010011001101010011 |
3 | 120212111102001202102202200201 |
4 | 123201010300312103031103 |
5 | 111330243142414241321 |
6 | 1105215512235400031 |
7 | 34330262135023330 |
oct | 3341046066231523 |
9 | 525442052382621 |
10 | 121020113040211 |
11 | 35619383906990 |
12 | 116a6612bb3017 |
13 | 526b1bc62b228 |
14 | 21c55947c5987 |
15 | ded026a16291 |
hex | 6e1130d93353 |
121020113040211 has 16 divisors (see below), whose sum is σ = 150918515193600. Its totient is φ = 94278701573280.
The previous prime is 121020113040149. The next prime is 121020113040223. The reversal of 121020113040211 is 112040311020121.
It is not a de Polignac number, because 121020113040211 - 243 = 112224020018003 is a prime.
It is a super-3 number, since 3×1210201130402113 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (121020113040311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 188721261 + ... + 189361438.
It is an arithmetic number, because the mean of its divisors is an integer number (9432407199600).
Almost surely, 2121020113040211 is an apocalyptic number.
121020113040211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121020113040211 is a deficient number, since it is larger than the sum of its proper divisors (29898402153389).
121020113040211 is a wasteful number, since it uses less digits than its factorization.
121020113040211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378086874.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 121020113040211 its reverse (112040311020121), we get a palindrome (233060424060332).
The spelling of 121020113040211 in words is "one hundred twenty-one trillion, twenty billion, one hundred thirteen million, forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •