Base | Representation |
---|---|
bin | 111000010110110001… |
… | …0100010000000111110 |
3 | 102120101022100001020222 |
4 | 1300231202202000332 |
5 | 3440323404024410 |
6 | 131333001141342 |
7 | 11513031320660 |
oct | 1605542420076 |
9 | 376338301228 |
10 | 121023111230 |
11 | 4736443379a |
12 | 1b55648a852 |
13 | b549156b28 |
14 | 5c0118c530 |
15 | 3234bee955 |
hex | 1c2d8a203e |
121023111230 has 64 divisors (see below), whose sum is σ = 261206138880. Its totient is φ = 39496809600.
The previous prime is 121023111229. The next prime is 121023111239. The reversal of 121023111230 is 32111320121.
It is a super-2 number, since 2×1210231112302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121023111199 and 121023111208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121023111239) 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, 324770 + ... + 589509.
It is an arithmetic number, because the mean of its divisors is an integer number (4081345920).
Almost surely, 2121023111230 is an apocalyptic number.
121023111230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121023111230 is an abundant number, since it is smaller than the sum of its proper divisors (140183027650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121023111230 is a wasteful number, since it uses less digits than its factorization.
121023111230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 914385.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121023111230 its reverse (32111320121), we get a palindrome (153134431351).
The spelling of 121023111230 in words is "one hundred twenty-one billion, twenty-three million, one hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •