Base | Representation |
---|---|
bin | 111000010110110001… |
… | …0111010100111111000 |
3 | 102120101022112011112002 |
4 | 1300231202322213320 |
5 | 3440323420241044 |
6 | 131333003240132 |
7 | 11513032220561 |
oct | 1605542724770 |
9 | 376338464462 |
10 | 121023212024 |
11 | 473644a24a0 |
12 | 1b556519048 |
13 | b549190980 |
14 | 5c011b7168 |
15 | 3234c1e74e |
hex | 1c2d8ba9f8 |
121023212024 has 128 divisors (see below), whose sum is σ = 285070726080. Its totient is φ = 47318016000.
The previous prime is 121023212021. The next prime is 121023212033. The reversal of 121023212024 is 420212320121.
121023212024 = T28112 + T28113 + ... + T28414.
It is a junction number, because it is equal to n+sod(n) for n = 121023211987 and 121023212005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121023212021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1933442 + ... + 1995054.
Almost surely, 2121023212024 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121023212024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142535363040).
121023212024 is an abundant number, since it is smaller than the sum of its proper divisors (164047514056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121023212024 is a wasteful number, since it uses less digits than its factorization.
121023212024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61761 (or 61757 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 121023212024 its reverse (420212320121), we get a palindrome (541235532145).
The spelling of 121023212024 in words is "one hundred twenty-one billion, twenty-three million, two hundred twelve thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •