Base | Representation |
---|---|
bin | 100111011001011110… |
… | …011001100010010101 |
3 | 11001012012011211212210 |
4 | 213121132121202111 |
5 | 1143114123033303 |
6 | 31233415104033 |
7 | 3025213242636 |
oct | 473136314225 |
9 | 131165154783 |
10 | 42303330453 |
11 | 16a3914432a |
12 | 8247372019 |
13 | 3cb23225a7 |
14 | 209446588d |
15 | 1178d15203 |
hex | 9d9799895 |
42303330453 has 8 divisors (see below), whose sum is σ = 58223938816. Its totient is φ = 27292471200.
The previous prime is 42303330449. The next prime is 42303330493. The reversal of 42303330453 is 35403330324.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42303330453 - 22 = 42303330449 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 42303330453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42303330413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 227437168 + ... + 227437353.
It is an arithmetic number, because the mean of its divisors is an integer number (7277992352).
Almost surely, 242303330453 is an apocalyptic number.
It is an amenable number.
42303330453 is a deficient number, since it is larger than the sum of its proper divisors (15920608363).
42303330453 is a wasteful number, since it uses less digits than its factorization.
42303330453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454874555.
The product of its (nonzero) digits is 38880, while the sum is 30.
Adding to 42303330453 its reverse (35403330324), we get a palindrome (77706660777).
The spelling of 42303330453 in words is "forty-two billion, three hundred three million, three hundred thirty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •