Base | Representation |
---|---|
bin | 11010001100001110… |
… | …10101010111111000 |
3 | 1100021221200110202000 |
4 | 31012013111113320 |
5 | 212244133321220 |
6 | 10243140541000 |
7 | 1005310323240 |
oct | 150607252770 |
9 | 40257613660 |
10 | 14061229560 |
11 | 5a66219984 |
12 | 28850b1760 |
13 | 14311c96a1 |
14 | 975694b20 |
15 | 5746ca390 |
hex | 3461d55f8 |
14061229560 has 256 divisors, whose sum is σ = 54446515200. Its totient is φ = 3161203200.
The previous prime is 14061229541. The next prime is 14061229571. The reversal of 14061229560 is 6592216041.
14061229560 is a `hidden beast` number, since 14 + 0 + 61 + 2 + 29 + 560 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 445915 + ... + 476405.
It is an arithmetic number, because the mean of its divisors is an integer number (212681700).
Almost surely, 214061229560 is an apocalyptic number.
14061229560 is a gapful number since it is divisible by the number (10) 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 14061229560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27223257600).
14061229560 is an abundant number, since it is smaller than the sum of its proper divisors (40385285640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14061229560 is a wasteful number, since it uses less digits than its factorization.
14061229560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30579 (or 30569 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 14061229560 in words is "fourteen billion, sixty-one million, two hundred twenty-nine thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •