Base | Representation |
---|---|
bin | 1001000110001110011010… |
… | …00000000010100101101101 |
3 | 2121211110122221211212011022 |
4 | 10203013031000002211231 |
5 | 10110230422110143412 |
6 | 110314114512303525 |
7 | 4133215035435233 |
oct | 443071500024555 |
9 | 77743587755138 |
10 | 20005102037357 |
11 | 6413130628238 |
12 | 22b1158241ba5 |
13 | b2161c31a558 |
14 | 4d2375ac0953 |
15 | 24a5a2c45a72 |
hex | 1231cd00296d |
20005102037357 has 4 divisors (see below), whose sum is σ = 20005474050720. Its totient is φ = 20004730023996.
The previous prime is 20005102037311. The next prime is 20005102037447. The reversal of 20005102037357 is 75373020150002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20005102037357 - 230 = 20004028295533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20005102037857) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 185926007 + ... + 186033572.
It is an arithmetic number, because the mean of its divisors is an integer number (5001368512680).
Almost surely, 220005102037357 is an apocalyptic number.
It is an amenable number.
20005102037357 is a deficient number, since it is larger than the sum of its proper divisors (372013363).
20005102037357 is an equidigital number, since it uses as much as digits as its factorization.
20005102037357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 372013362.
The product of its (nonzero) digits is 44100, while the sum is 35.
Adding to 20005102037357 its reverse (75373020150002), we get a palindrome (95378122187359).
The spelling of 20005102037357 in words is "twenty trillion, five billion, one hundred two million, thirty-seven thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •