Base | Representation |
---|---|
bin | 11110100101110111011… |
… | …000111101111001011001 |
3 | 21102222020212021200212101 |
4 | 132211313120331321121 |
5 | 233420342430311213 |
6 | 4245431234443401 |
7 | 304611342342352 |
oct | 36456730757131 |
9 | 7388225250771 |
10 | 2102242041433 |
11 | 740612910896 |
12 | 29b518733561 |
13 | 123318705241 |
14 | 73a6b5b2d29 |
15 | 39a3de8abdd |
hex | 1e97763de59 |
2102242041433 has 4 divisors (see below), whose sum is σ = 2174733146340. Its totient is φ = 2029750936528.
The previous prime is 2102242041409. The next prime is 2102242041499. The reversal of 2102242041433 is 3341402422012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1441853395984 + 660388645449 = 1200772^2 + 812643^2 .
It is a cyclic number.
It is not a de Polignac number, because 2102242041433 - 233 = 2093652106841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2102242021433) 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, 36245552410 + ... + 36245552467.
It is an arithmetic number, because the mean of its divisors is an integer number (543683286585).
Almost surely, 22102242041433 is an apocalyptic number.
It is an amenable number.
2102242041433 is a deficient number, since it is larger than the sum of its proper divisors (72491104907).
2102242041433 is an equidigital number, since it uses as much as digits as its factorization.
2102242041433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72491104906.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 2102242041433 its reverse (3341402422012), we get a palindrome (5443644463445).
The spelling of 2102242041433 in words is "two trillion, one hundred two billion, two hundred forty-two million, forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •