Base | Representation |
---|---|
bin | 11010000010101110… |
… | …100001010100101100 |
3 | 2200011210101110102000 |
4 | 122002232201110230 |
5 | 424232014140342 |
6 | 20502424532300 |
7 | 2006643615063 |
oct | 320256412454 |
9 | 80153343360 |
10 | 27963036972 |
11 | 1094a450612 |
12 | 5504921090 |
13 | 2838378630 |
14 | 14d3acb1da |
15 | ad9db444c |
hex | 682ba152c |
27963036972 has 384 divisors, whose sum is σ = 86587468800. Its totient is φ = 7726233600.
The previous prime is 27963036971. The next prime is 27963036989.
27963036972 is a `hidden beast` number, since 279 + 6 + 3 + 0 + 369 + 7 + 2 = 666.
27963036972 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (27963036971) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 40467147 + ... + 40467837.
It is an arithmetic number, because the mean of its divisors is an integer number (225488200).
Almost surely, 227963036972 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 27963036972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43293734400).
27963036972 is an abundant number, since it is smaller than the sum of its proper divisors (58624431828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27963036972 is a wasteful number, since it uses less digits than its factorization.
27963036972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 814 (or 806 counting only the distinct ones).
The product of its (nonzero) digits is 5143824, while the sum is 54.
The spelling of 27963036972 in words is "twenty-seven billion, nine hundred sixty-three million, thirty-six thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •