Base | Representation |
---|---|
bin | 11011100000111110001110… |
… | …111101011011000111001111 |
3 | 120212110201222010222121112102 |
4 | 123200332032331123013033 |
5 | 111330134313110000221 |
6 | 1105212352425225315 |
7 | 34326623323313210 |
oct | 3340761675330717 |
9 | 525421863877472 |
10 | 121013102031311 |
11 | 35616406323156 |
12 | 116a519703223b |
13 | 526a642c6c459 |
14 | 21c50cb601407 |
15 | decc6627530b |
hex | 6e0f8ef5b1cf |
121013102031311 has 8 divisors (see below), whose sum is σ = 138302075876640. Its totient is φ = 103724475146208.
The previous prime is 121013102031307. The next prime is 121013102031391. The reversal of 121013102031311 is 113130201310121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121013102031311 - 22 = 121013102031307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121013102031301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85992236 + ... + 87388161.
It is an arithmetic number, because the mean of its divisors is an integer number (17287759484580).
Almost surely, 2121013102031311 is an apocalyptic number.
121013102031311 is a deficient number, since it is larger than the sum of its proper divisors (17288973845329).
121013102031311 is an equidigital number, since it uses as much as digits as its factorization.
121013102031311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173480113.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 121013102031311 its reverse (113130201310121), we get a palindrome (234143303341432).
The spelling of 121013102031311 in words is "one hundred twenty-one trillion, thirteen billion, one hundred two million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •