Base | Representation |
---|---|
bin | 11011100001000110110101… |
… | …000011001011111111011000 |
3 | 120212111121210022221100200011 |
4 | 123201012311003023333120 |
5 | 111330312213214323112 |
6 | 1105220520310251304 |
7 | 34330401116330503 |
oct | 3341066503137730 |
9 | 525447708840604 |
10 | 121022331011032 |
11 | 3561a3118a0220 |
12 | 116a6b31956b34 |
13 | 526b483cb24b9 |
14 | 21c57251c013a |
15 | ded1065d2aa7 |
hex | 6e11b50cbfd8 |
121022331011032 has 64 divisors (see below), whose sum is σ = 248853350368800. Its totient is φ = 54719994455040.
The previous prime is 121022331011011. The next prime is 121022331011063. The reversal of 121022331011032 is 230110133220121.
It is a super-2 number, since 2×1210223310110322 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 121022331010994 and 121022331011012.
It is a congruent number.
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, 19369518 + ... + 24843970.
Almost surely, 2121022331011032 is an apocalyptic number.
It is an amenable number.
121022331011032 is an abundant number, since it is smaller than the sum of its proper divisors (127831019357768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121022331011032 is a wasteful number, since it uses less digits than its factorization.
121022331011032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5475796 (or 5475792 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 121022331011032 its reverse (230110133220121), we get a palindrome (351132464231153).
The spelling of 121022331011032 in words is "one hundred twenty-one trillion, twenty-two billion, three hundred thirty-one million, eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •