Base | Representation |
---|---|
bin | 10010111000010100… |
… | …110111001111011001 |
3 | 1221022210222212211100 |
4 | 102320110313033121 |
5 | 313004210033243 |
6 | 13151334422013 |
7 | 1315240045530 |
oct | 227024671731 |
9 | 57283885740 |
10 | 20272346073 |
11 | 8663235721 |
12 | 3b19201909 |
13 | 1bb0c42565 |
14 | da453b317 |
15 | 7d9b160d3 |
hex | 4b85373d9 |
20272346073 has 48 divisors (see below), whose sum is σ = 35175718656. Its totient is φ = 10999549440.
The previous prime is 20272346063. The next prime is 20272346113. The reversal of 20272346073 is 37064327202.
20272346073 is a `hidden beast` number, since 2 + 0 + 27 + 23 + 4 + 607 + 3 = 666.
It is not a de Polignac number, because 20272346073 - 26 = 20272346009 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (20272346063) 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 47 ways as a sum of consecutive naturals, for example, 147453 + ... + 249573.
It is an arithmetic number, because the mean of its divisors is an integer number (732827472).
Almost surely, 220272346073 is an apocalyptic number.
20272346073 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20272346073 is a deficient number, since it is larger than the sum of its proper divisors (14903372583).
20272346073 is a wasteful number, since it uses less digits than its factorization.
20272346073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102294 (or 102291 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 36.
The spelling of 20272346073 in words is "twenty billion, two hundred seventy-two million, three hundred forty-six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •