Base | Representation |
---|---|
bin | 11011100101011100000100… |
… | …010010010000000011100011 |
3 | 120220120002011022022110210220 |
4 | 123211130010102100003203 |
5 | 111400201341323301311 |
6 | 1110005351122454123 |
7 | 34361040010345560 |
oct | 3345340422200343 |
9 | 526502138273726 |
10 | 121320013103331 |
11 | 3572458a655119 |
12 | 1173476ab04343 |
13 | 5290574838c93 |
14 | 21d5cc4551867 |
15 | e05c2a534206 |
hex | 6e57044900e3 |
121320013103331 has 32 divisors (see below), whose sum is σ = 189866947089408. Its totient is φ = 67451376032640.
The previous prime is 121320013103321. The next prime is 121320013103351. The reversal of 121320013103331 is 133301310023121.
It is not a de Polignac number, because 121320013103331 - 25 = 121320013103299 is a prime.
It is a super-2 number, since 2×1213200131033312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121320013103321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82270641 + ... + 83732301.
It is an arithmetic number, because the mean of its divisors is an integer number (5933342096544).
Almost surely, 2121320013103331 is an apocalyptic number.
121320013103331 is a deficient number, since it is larger than the sum of its proper divisors (68546933986077).
121320013103331 is a wasteful number, since it uses less digits than its factorization.
121320013103331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1568531.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 121320013103331 its reverse (133301310023121), we get a palindrome (254621323126452).
The spelling of 121320013103331 in words is "one hundred twenty-one trillion, three hundred twenty billion, thirteen million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •