Base | Representation |
---|---|
bin | 101011001111001000010… |
… | …0111010101001110000101 |
3 | 210001002021200222222222211 |
4 | 1112132100213111032011 |
5 | 1234324431144000010 |
6 | 20345515114223421 |
7 | 1152215240411521 |
oct | 126362047251605 |
9 | 23032250888884 |
10 | 5942366000005 |
11 | 19911637651a6 |
12 | 7bb806424b71 |
13 | 341493b45a16 |
14 | 16787d668d81 |
15 | a48942e208a |
hex | 567909d5385 |
5942366000005 has 4 divisors (see below), whose sum is σ = 7130839200012. Its totient is φ = 4753892800000.
The previous prime is 5942365999993. The next prime is 5942366000083. The reversal of 5942366000005 is 5000006632495.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2270271454564 + 3672094545441 = 1506742^2 + 1916271^2 .
It is not a de Polignac number, because 5942366000005 - 223 = 5942357611397 is a prime.
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 Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 594236599996 + ... + 594236600005.
It is an arithmetic number, because the mean of its divisors is an integer number (1782709800003).
Almost surely, 25942366000005 is an apocalyptic number.
It is an amenable number.
5942366000005 is a deficient number, since it is larger than the sum of its proper divisors (1188473200007).
5942366000005 is a wasteful number, since it uses less digits than its factorization.
5942366000005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188473200006.
The product of its (nonzero) digits is 194400, while the sum is 40.
The spelling of 5942366000005 in words is "five trillion, nine hundred forty-two billion, three hundred sixty-six million, five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •