Base | Representation |
---|---|
bin | 11011100010010001111110… |
… | …000101101111001000110110 |
3 | 120212210100001012220212022102 |
4 | 123202101332011233020312 |
5 | 111333122432401423110 |
6 | 1105321542320102102 |
7 | 34336255364504102 |
oct | 3342217605571066 |
9 | 525710035825272 |
10 | 121103013311030 |
11 | 356505549573a3 |
12 | 116ba6aa164932 |
13 | 5275c7159a10a |
14 | 21c95ba806902 |
15 | e002799295a5 |
hex | 6e247e16f236 |
121103013311030 has 16 divisors (see below), whose sum is σ = 218143270055664. Its totient is φ = 48406128414240.
The previous prime is 121103013311029. The next prime is 121103013311143. The reversal of 121103013311030 is 30113310301121.
It is a junction number, because it is equal to n+sod(n) for n = 121103013310993 and 121103013311011.
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, 4384599272 + ... + 4384626891.
It is an arithmetic number, because the mean of its divisors is an integer number (13633954378479).
Almost surely, 2121103013311030 is an apocalyptic number.
121103013311030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121103013311030 is a deficient number, since it is larger than the sum of its proper divisors (97040256744634).
121103013311030 is a wasteful number, since it uses less digits than its factorization.
121103013311030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8769227551.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 121103013311030 its reverse (30113310301121), we get a palindrome (151216323612151).
The spelling of 121103013311030 in words is "one hundred twenty-one trillion, one hundred three billion, thirteen million, three hundred eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •