Base | Representation |
---|---|
bin | 1110000101111011100… |
… | …1100000000100010001 |
3 | 212010221002020120222012 |
4 | 3201132321200010101 |
5 | 12431320214103213 |
6 | 303120211552305 |
7 | 23330501412131 |
oct | 3413671400421 |
9 | 763832216865 |
10 | 242110300433 |
11 | 93750a53191 |
12 | 3ab0a2bb695 |
13 | 19aa5657b01 |
14 | ba0aa5aac1 |
15 | 647035a4a8 |
hex | 385ee60111 |
242110300433 has 4 divisors (see below), whose sum is σ = 242177875968. Its totient is φ = 242042724900.
The previous prime is 242110300427. The next prime is 242110300451. The reversal of 242110300433 is 334003011242.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-242110300433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 242110300399 and 242110300408.
It is not an unprimeable number, because it can be changed into a prime (242110360433) 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, 33782393 + ... + 33789558.
It is an arithmetic number, because the mean of its divisors is an integer number (60544468992).
Almost surely, 2242110300433 is an apocalyptic number.
It is an amenable number.
242110300433 is a deficient number, since it is larger than the sum of its proper divisors (67575535).
242110300433 is an equidigital number, since it uses as much as digits as its factorization.
242110300433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67575534.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 242110300433 its reverse (334003011242), we get a palindrome (576113311675).
The spelling of 242110300433 in words is "two hundred forty-two billion, one hundred ten million, three hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •