Base | Representation |
---|---|
bin | 11011100001000111100100… |
… | …001001111110100101110110 |
3 | 120212111200211102001020012011 |
4 | 123201013210021332211312 |
5 | 111330320323024222220 |
6 | 1105221130541314434 |
7 | 34330426524003256 |
oct | 3341074411764566 |
9 | 525450742036164 |
10 | 121023121320310 |
11 | 3561a687a12290 |
12 | 116a7112565a1a |
13 | 526b57b951521 |
14 | 21c579c145966 |
15 | ded150b9365a |
hex | 6e11e427e976 |
121023121320310 has 16 divisors (see below), whose sum is σ = 237645401865552. Its totient is φ = 44008407752800.
The previous prime is 121023121320301. The next prime is 121023121320337. The reversal of 121023121320310 is 13023121320121.
It is a super-3 number, since 3×1210231213203103 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
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, 550105096801 + ... + 550105097020.
It is an arithmetic number, because the mean of its divisors is an integer number (14852837616597).
Almost surely, 2121023121320310 is an apocalyptic number.
121023121320310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121023121320310 is a deficient number, since it is larger than the sum of its proper divisors (116622280545242).
121023121320310 is a wasteful number, since it uses less digits than its factorization.
121023121320310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100210193839.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 121023121320310 its reverse (13023121320121), we get a palindrome (134046242640431).
The spelling of 121023121320310 in words is "one hundred twenty-one trillion, twenty-three billion, one hundred twenty-one million, three hundred twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •