Base | Representation |
---|---|
bin | 100100110110010001011… |
… | …1101110110001011101010 |
3 | 122221010222110210022101011 |
4 | 1021230202331312023222 |
5 | 1130433243342030132 |
6 | 14434310502214134 |
7 | 1031613250626244 |
oct | 111544275661352 |
9 | 18833873708334 |
10 | 5064353080042 |
11 | 1682864317033 |
12 | 69960972434a |
13 | 2a9749636c59 |
14 | 13718a41d094 |
15 | 8bb071e0b47 |
hex | 49b22f762ea |
5064353080042 has 4 divisors (see below), whose sum is σ = 7596529620066. Its totient is φ = 2532176540020.
The previous prime is 5064353079901. The next prime is 5064353080043. The reversal of 5064353080042 is 2400803534605.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 5036886978601 + 27466101441 = 2244301^2 + 165729^2 .
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 5064353079977 and 5064353080004.
It is not an unprimeable number, because it can be changed into a prime (5064353080043) by changing a digit.
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 as a sum of consecutive naturals, namely, 1266088270009 + ... + 1266088270012.
Almost surely, 25064353080042 is an apocalyptic number.
5064353080042 is a deficient number, since it is larger than the sum of its proper divisors (2532176540024).
5064353080042 is a wasteful number, since it uses less digits than its factorization.
5064353080042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2532176540023.
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 5064353080042 in words is "five trillion, sixty-four billion, three hundred fifty-three million, eighty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •