Base | Representation |
---|---|
bin | 11011100101001010100011… |
… | …001000001100111100100111 |
3 | 120220111021121102011220000210 |
4 | 123211022203020030330213 |
5 | 111344344331010210043 |
6 | 1105553000425310503 |
7 | 34356502616033514 |
oct | 3345124310147447 |
9 | 526437542156023 |
10 | 121301203210023 |
11 | 35717607994951 |
12 | 11730b9b635433 |
13 | 528b8678a06b5 |
14 | 21d501c34230b |
15 | e054c8eec633 |
hex | 6e52a320cf27 |
121301203210023 has 12 divisors (see below), whose sum is σ = 167120492251704. Its totient is φ = 78258840778800.
The previous prime is 121301203210009. The next prime is 121301203210111. The reversal of 121301203210023 is 320012302103121.
It is not a de Polignac number, because 121301203210023 - 216 = 121301203144487 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121301203210123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21037319908 + ... + 21037325673.
It is an arithmetic number, because the mean of its divisors is an integer number (13926707687642).
Almost surely, 2121301203210023 is an apocalyptic number.
121301203210023 is a deficient number, since it is larger than the sum of its proper divisors (45819289041681).
121301203210023 is an equidigital number, since it uses as much as digits as its factorization.
121301203210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42074645646 (or 42074645615 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121301203210023 its reverse (320012302103121), we get a palindrome (441313505313144).
The spelling of 121301203210023 in words is "one hundred twenty-one trillion, three hundred one billion, two hundred three million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •