Base | Representation |
---|---|
bin | 1001010011001011111000… |
… | …00010111010000011011001 |
3 | 2200102001002221222021002012 |
4 | 10221211330002322003121 |
5 | 10140024430112324423 |
6 | 111254443215115305 |
7 | 4210331324362106 |
oct | 451457402720331 |
9 | 80361087867065 |
10 | 20450420433113 |
11 | 6574a7a214070 |
12 | 2363518512b35 |
13 | b5460a808988 |
14 | 509b3c913aad |
15 | 256e67ec2078 |
hex | 12997c0ba0d9 |
20450420433113 has 8 divisors (see below), whose sum is σ = 22370338531200. Its totient is φ = 18540633829680.
The previous prime is 20450420433101. The next prime is 20450420433133. The reversal of 20450420433113 is 31133402405402.
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 20450420433113 - 210 = 20450420432089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20450420433113.
It is not an unprimeable number, because it can be changed into a prime (20450420433133) 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, 2532869438 + ... + 2532877511.
It is an arithmetic number, because the mean of its divisors is an integer number (2796292316400).
Almost surely, 220450420433113 is an apocalyptic number.
It is an amenable number.
20450420433113 is a deficient number, since it is larger than the sum of its proper divisors (1919918098087).
20450420433113 is a wasteful number, since it uses less digits than its factorization.
20450420433113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5065747327.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 20450420433113 its reverse (31133402405402), we get a palindrome (51583822838515).
The spelling of 20450420433113 in words is "twenty trillion, four hundred fifty billion, four hundred twenty million, four hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •