Base | Representation |
---|---|
bin | 1001001111001010000110… |
… | …10101010100000000000001 |
3 | 2122220210220021222000101222 |
4 | 10213211003111110000001 |
5 | 10130243014140100301 |
6 | 111111115012004425 |
7 | 4164332016212006 |
oct | 447450325240001 |
9 | 78823807860358 |
10 | 20312030003201 |
11 | 6521313448842 |
12 | 2340735900715 |
13 | b44554550721 |
14 | 503170d8b8ad |
15 | 25356874031b |
hex | 127943554001 |
20312030003201 has 8 divisors (see below), whose sum is σ = 20696024712384. Its totient is φ = 19928063029680.
The previous prime is 20312030003197. The next prime is 20312030003203. The reversal of 20312030003201 is 10230003021302.
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 20312030003201 - 22 = 20312030003197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20312030003201.
It is not an unprimeable number, because it can be changed into a prime (20312030003203) 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, 5452421 + ... + 8387666.
It is an arithmetic number, because the mean of its divisors is an integer number (2587003089048).
Almost surely, 220312030003201 is an apocalyptic number.
It is an amenable number.
20312030003201 is a deficient number, since it is larger than the sum of its proper divisors (383994709183).
20312030003201 is a wasteful number, since it uses less digits than its factorization.
20312030003201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13867831.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 20312030003201 its reverse (10230003021302), we get a palindrome (30542033024503).
The spelling of 20312030003201 in words is "twenty trillion, three hundred twelve billion, thirty million, three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •