Base | Representation |
---|---|
bin | 1000110100110101010… |
… | …01010110000000010111 |
3 | 1001222201110202212220221 |
4 | 10122122221112000113 |
5 | 14432020003140043 |
6 | 351150233335211 |
7 | 30623424340222 |
oct | 4323251260027 |
9 | 1058643685827 |
10 | 303242240023 |
11 | 107671380208 |
12 | 4a92b267507 |
13 | 22798769728 |
14 | 109699a45b9 |
15 | 7d4c1528ed |
hex | 469aa56017 |
303242240023 has 2 divisors, whose sum is σ = 303242240024. Its totient is φ = 303242240022.
The previous prime is 303242239981. The next prime is 303242240039. The reversal of 303242240023 is 320042242303.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-303242240023 is a prime.
It is a super-2 number, since 2×3032422400232 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 303242240023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (303242243023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151621120011 + 151621120012.
It is an arithmetic number, because the mean of its divisors is an integer number (151621120012).
Almost surely, 2303242240023 is an apocalyptic number.
303242240023 is a deficient number, since it is larger than the sum of its proper divisors (1).
303242240023 is an equidigital number, since it uses as much as digits as its factorization.
303242240023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 25.
Adding to 303242240023 its reverse (320042242303), we get a palindrome (623284482326).
The spelling of 303242240023 in words is "three hundred three billion, two hundred forty-two million, two hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •