Base | Representation |
---|---|
bin | 11011100101001100011010… |
… | …001001110001101000011010 |
3 | 120220111110202120200222101001 |
4 | 123211030122021301220122 |
5 | 111344412423212024010 |
6 | 1105553530522015214 |
7 | 34356603244310602 |
oct | 3345143211615032 |
9 | 526443676628331 |
10 | 121303200111130 |
11 | 35718442105244 |
12 | 1173145834750a |
13 | 528bac550139b |
14 | 21d516b631c02 |
15 | e0559449bc3a |
hex | 6e531a271a1a |
121303200111130 has 16 divisors (see below), whose sum is σ = 218346767263944. Its totient is φ = 48521056252480.
The previous prime is 121303200111029. The next prime is 121303200111151. The reversal of 121303200111130 is 31111002303121.
121303200111130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 66145054627521 + 55158145483609 = 8132961^2 + 7426853^2 .
It is a junction number, because it is equal to n+sod(n) for n = 121303200111098 and 121303200111107.
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, 25688557 + ... + 30041776.
Almost surely, 2121303200111130 is an apocalyptic number.
121303200111130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121303200111130 is a deficient number, since it is larger than the sum of its proper divisors (97043567152814).
121303200111130 is a wasteful number, since it uses less digits than its factorization.
121303200111130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55948001.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 121303200111130 its reverse (31111002303121), we get a palindrome (152414202414251).
The spelling of 121303200111130 in words is "one hundred twenty-one trillion, three hundred three billion, two hundred million, one hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •