Base | Representation |
---|---|
bin | 1001000110001010101110… |
… | …01010101000110110100011 |
3 | 2121211021120011220020110122 |
4 | 10203011113022220312203 |
5 | 10110212400011312120 |
6 | 110313150411550455 |
7 | 4133115041664233 |
oct | 443052712506643 |
9 | 77737504806418 |
10 | 20003125104035 |
11 | 6412306705a47 |
12 | 22b08a615b42b |
13 | b2139588b418 |
14 | 4d222930bcc3 |
15 | 24a4d93dca25 |
hex | 1231572a8da3 |
20003125104035 has 8 divisors (see below), whose sum is σ = 24003774137616. Its totient is φ = 16002484074720.
The previous prime is 20003125104031. The next prime is 20003125104049. The reversal of 20003125104035 is 53040152130002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20003125104035 - 22 = 20003125104031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20003125103995 and 20003125104013.
It is not an unprimeable number, because it can be changed into a prime (20003125104031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8673320 + ... + 10734650.
It is an arithmetic number, because the mean of its divisors is an integer number (3000471767202).
Almost surely, 220003125104035 is an apocalyptic number.
20003125104035 is a deficient number, since it is larger than the sum of its proper divisors (4000649033581).
20003125104035 is a wasteful number, since it uses less digits than its factorization.
20003125104035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4002133.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 20003125104035 its reverse (53040152130002), we get a palindrome (73043277234037).
The spelling of 20003125104035 in words is "twenty trillion, three billion, one hundred twenty-five million, one hundred four thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •