Base | Representation |
---|---|
bin | 10010111100101111… |
… | …100011100001001101 |
3 | 1221111222102212002222 |
4 | 102330233203201031 |
5 | 313132142431140 |
6 | 13202543025125 |
7 | 1320126663113 |
oct | 227457434115 |
9 | 57458385088 |
10 | 20346452045 |
11 | 86a1050627 |
12 | 3b39b9b1a5 |
13 | 1bc33bac4a |
14 | db030bab3 |
15 | 7e13a35b5 |
hex | 4bcbe384d |
20346452045 has 8 divisors (see below), whose sum is σ = 24935226624. Its totient is φ = 15930838864.
The previous prime is 20346452041. The next prime is 20346452051. The reversal of 20346452045 is 54025464302.
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 20346452045 - 22 = 20346452041 is a prime.
It is a super-2 number, since 2×203464520452 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20346451996 and 20346452014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20346452041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43290089 + ... + 43290558.
It is an arithmetic number, because the mean of its divisors is an integer number (3116903328).
Almost surely, 220346452045 is an apocalyptic number.
It is an amenable number.
20346452045 is a deficient number, since it is larger than the sum of its proper divisors (4588774579).
20346452045 is an equidigital number, since it uses as much as digits as its factorization.
20346452045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86580699.
The product of its (nonzero) digits is 115200, while the sum is 35.
The spelling of 20346452045 in words is "twenty billion, three hundred forty-six million, four hundred fifty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •