Base | Representation |
---|---|
bin | 11011100101001010100011… |
… | …101010001001110011000111 |
3 | 120220111021122000221001112102 |
4 | 123211022203222021303013 |
5 | 111344344340300010043 |
6 | 1105553001344142315 |
7 | 34356503054502161 |
oct | 3345124352116307 |
9 | 526437560831472 |
10 | 121301212110023 |
11 | 35717611a13620 |
12 | 11730ba260799b |
13 | 528b86969867a |
14 | 21d501d5bb931 |
15 | e054c9ba96b8 |
hex | 6e52a3a89cc7 |
121301212110023 has 16 divisors (see below), whose sum is σ = 138103080602400. Its totient is φ = 105529059578880.
The previous prime is 121301212110017. The next prime is 121301212110049. The reversal of 121301212110023 is 320011212103121.
It is a cyclic number.
It is not a de Polignac number, because 121301212110023 - 24 = 121301212110007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121301212109977 and 121301212110004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121301212110073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1682506358 + ... + 1682578451.
It is an arithmetic number, because the mean of its divisors is an integer number (8631442537650).
Almost surely, 2121301212110023 is an apocalyptic number.
121301212110023 is a deficient number, since it is larger than the sum of its proper divisors (16801868492377).
121301212110023 is a wasteful number, since it uses less digits than its factorization.
121301212110023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3365084962.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 121301212110023 its reverse (320011212103121), we get a palindrome (441312424213144).
The spelling of 121301212110023 in words is "one hundred twenty-one trillion, three hundred one billion, two hundred twelve million, one hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •