Base | Representation |
---|---|
bin | 11011100000111110010110… |
… | …101101100110101001110011 |
3 | 120212110202022012201212222110 |
4 | 123200332112231212221303 |
5 | 111330140044404231003 |
6 | 1105212413353140403 |
7 | 34326626463020103 |
oct | 3340762655465163 |
9 | 525422265655873 |
10 | 121013232102003 |
11 | 3561647279319a |
12 | 116a52126ba703 |
13 | 526a663bb1167 |
14 | 21c51009bd203 |
15 | decc728b9a03 |
hex | 6e0f96b66a73 |
121013232102003 has 4 divisors (see below), whose sum is σ = 161350976136008. Its totient is φ = 80675488068000.
The previous prime is 121013232102001. The next prime is 121013232102047. The reversal of 121013232102003 is 300201232310121.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 121013232102003 - 21 = 121013232102001 is a prime.
It is a super-2 number, since 2×1210132321020032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121013232102001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20168872016998 + ... + 20168872017003.
It is an arithmetic number, because the mean of its divisors is an integer number (40337744034002).
Almost surely, 2121013232102003 is an apocalyptic number.
121013232102003 is a deficient number, since it is larger than the sum of its proper divisors (40337744034005).
121013232102003 is an equidigital number, since it uses as much as digits as its factorization.
121013232102003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40337744034004.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121013232102003 its reverse (300201232310121), we get a palindrome (421214464412124).
The spelling of 121013232102003 in words is "one hundred twenty-one trillion, thirteen billion, two hundred thirty-two million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •