Base | Representation |
---|---|
bin | 10010101111101011… |
… | …010011001000000000 |
3 | 1220221200221100110000 |
4 | 102233223103020000 |
5 | 312210032420022 |
6 | 13125112240000 |
7 | 1311525440112 |
oct | 225753231000 |
9 | 56850840400 |
10 | 20127232512 |
11 | 8599330762 |
12 | 3a986a0000 |
13 | 1b89b6484a |
14 | d8d1653b2 |
15 | 7cbeee6ac |
hex | 4afad3200 |
20127232512 has 200 divisors, whose sum is σ = 61214654556. Its totient is φ = 6581772288.
The previous prime is 20127232511. The next prime is 20127232523. The reversal of 20127232512 is 21523272102.
20127232512 is a `hidden beast` number, since 2 + 0 + 127 + 23 + 2 + 512 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 19955517696 + 171714816 = 141264^2 + 13104^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20127232511) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2193438 + ... + 2202594.
Almost surely, 220127232512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20127232512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30607327278).
20127232512 is an abundant number, since it is smaller than the sum of its proper divisors (41087422044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20127232512 is an frugal number, since it uses more digits than its factorization.
20127232512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9240 (or 9215 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The spelling of 20127232512 in words is "twenty billion, one hundred twenty-seven million, two hundred thirty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •