Base | Representation |
---|---|
bin | 100001111010111101000… |
… | …100000101101011100101 |
3 | 22020211211110222200012121 |
4 | 201322331010011223211 |
5 | 301142434311140401 |
6 | 4542511131545541 |
7 | 330261310055143 |
oct | 41727504055345 |
9 | 8224743880177 |
10 | 2331044240101 |
11 | 819654781165 |
12 | 317931bbb2b1 |
13 | 13ba7cbb4a05 |
14 | 80b749c2593 |
15 | 40980cd4ca1 |
hex | 21ebd105ae5 |
2331044240101 has 2 divisors, whose sum is σ = 2331044240102. Its totient is φ = 2331044240100.
The previous prime is 2331044240047. The next prime is 2331044240113. The reversal of 2331044240101 is 1010424401332.
2331044240101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1623073452001 + 707970788100 = 1273999^2 + 841410^2 .
It is a cyclic number.
It is not a de Polignac number, because 2331044240101 - 215 = 2331044207333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2331044240801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1165522120050 + 1165522120051.
It is an arithmetic number, because the mean of its divisors is an integer number (1165522120051).
Almost surely, 22331044240101 is an apocalyptic number.
It is an amenable number.
2331044240101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2331044240101 is an equidigital number, since it uses as much as digits as its factorization.
2331044240101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 2331044240101 its reverse (1010424401332), we get a palindrome (3341468641433).
The spelling of 2331044240101 in words is "two trillion, three hundred thirty-one billion, forty-four million, two hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •