Base | Representation |
---|---|
bin | 100110100101100110100… |
… | …1101001010011111101010 |
3 | 200210000002022202022212222 |
4 | 1031023031031022133222 |
5 | 1143342412200022102 |
6 | 15140210242234042 |
7 | 1055105666543021 |
oct | 115131515123752 |
9 | 20700068668788 |
10 | 5303432423402 |
11 | 176519a385313 |
12 | 717a10955922 |
13 | 2c615b05ba29 |
14 | 14498a6d58b8 |
15 | 92e4b3deaa2 |
hex | 4d2cd34a7ea |
5303432423402 has 8 divisors (see below), whose sum is σ = 8037160476996. Its totient is φ = 2624378931072.
The previous prime is 5303432423381. The next prime is 5303432423423. The reversal of 5303432423402 is 2043242343035.
It is an interprime number because it is at equal distance from previous prime (5303432423381) and next prime (5303432423423).
It can be written as a sum of positive squares in 2 ways, for example, as 5165160744601 + 138271678801 = 2272699^2 + 371849^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×53034324234022 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13668640073 + ... + 13668640460.
Almost surely, 25303432423402 is an apocalyptic number.
5303432423402 is a deficient number, since it is larger than the sum of its proper divisors (2733728053594).
5303432423402 is a wasteful number, since it uses less digits than its factorization.
5303432423402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27337280632.
The product of its (nonzero) digits is 207360, while the sum is 35.
Adding to 5303432423402 its reverse (2043242343035), we get a palindrome (7346674766437).
The spelling of 5303432423402 in words is "five trillion, three hundred three billion, four hundred thirty-two million, four hundred twenty-three thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •