Base | Representation |
---|---|
bin | 101101100100101011010101… |
… | …110111111111110011011101 |
3 | 222021200011101210000101012101 |
4 | 231210223111313333303131 |
5 | 202232341311201431110 |
6 | 1550141233432405101 |
7 | 60134525664215560 |
oct | 5544532567776335 |
9 | 867604353011171 |
10 | 200432532061405 |
11 | 58955a610a0a06 |
12 | 1a591201546791 |
13 | 87ab925738aa7 |
14 | 376cdb462a4d7 |
15 | 1828a9ba2213a |
hex | b64ad5dffcdd |
200432532061405 has 8 divisors (see below), whose sum is σ = 274878901112832. Its totient is φ = 137439450556368.
The previous prime is 200432532061373. The next prime is 200432532061427. The reversal of 200432532061405 is 504160235234002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200432532061405 - 25 = 200432532061373 is a prime.
It is a super-2 number, since 2×2004325320614052 (a number of 29 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 2863321886557 + ... + 2863321886626.
It is an arithmetic number, because the mean of its divisors is an integer number (34359862639104).
Almost surely, 2200432532061405 is an apocalyptic number.
It is an amenable number.
200432532061405 is a deficient number, since it is larger than the sum of its proper divisors (74446369051427).
200432532061405 is an equidigital number, since it uses as much as digits as its factorization.
200432532061405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5726643773195.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 200432532061405 its reverse (504160235234002), we get a palindrome (704592767295407).
The spelling of 200432532061405 in words is "two hundred trillion, four hundred thirty-two billion, five hundred thirty-two million, sixty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •