Base | Representation |
---|---|
bin | 11110000000000011… |
… | …10110111000000000 |
3 | 1112120111102210002100 |
4 | 33000001312320000 |
5 | 230441243124042 |
6 | 11222124350400 |
7 | 1110064651050 |
oct | 170001667000 |
9 | 45514383070 |
10 | 16106614272 |
11 | 6915844771 |
12 | 31560a5400 |
13 | 1698ba44b8 |
14 | acb1a5560 |
15 | 64405524c |
hex | 3c0076e00 |
16106614272 has 240 divisors, whose sum is σ = 53344523232. Its totient is φ = 4582932480.
The previous prime is 16106614261. The next prime is 16106614273. The reversal of 16106614272 is 27241660161.
16106614272 is a `hidden beast` number, since 1 + 6 + 10 + 6 + 614 + 27 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16106614273) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9063048 + ... + 9064824.
Almost surely, 216106614272 is an apocalyptic number.
16106614272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16106614272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26672261616).
16106614272 is an abundant number, since it is smaller than the sum of its proper divisors (37237908960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16106614272 is a wasteful number, since it uses less digits than its factorization.
16106614272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2089 (or 2070 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The spelling of 16106614272 in words is "sixteen billion, one hundred six million, six hundred fourteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •