Base | Representation |
---|---|
bin | 11010011100111010… |
… | …11011100010000000 |
3 | 1100122201010201112000 |
4 | 31032131123202000 |
5 | 213041004132210 |
6 | 10305101504000 |
7 | 1011630355065 |
oct | 151635334200 |
9 | 40581121460 |
10 | 14201239680 |
11 | 6028258621 |
12 | 2903b72000 |
13 | 145420b504 |
14 | 98a0dcc6c |
15 | 581b34ac0 |
hex | 34e75b880 |
14201239680 has 512 divisors, whose sum is σ = 55124064000. Its totient is φ = 3439263744.
The previous prime is 14201239607. The next prime is 14201239681. The reversal of 14201239680 is 8693210241.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (14201239681) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8518207 + ... + 8519873.
Almost surely, 214201239680 is an apocalyptic number.
14201239680 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 14201239680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27562032000).
14201239680 is an abundant number, since it is smaller than the sum of its proper divisors (40922824320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14201239680 is a wasteful number, since it uses less digits than its factorization.
14201239680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1741 (or 1723 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
It can be divided in two parts, 1420 and 1239680, that added together give a triangular number (1241100 = T1575).
The spelling of 14201239680 in words is "fourteen billion, two hundred one million, two hundred thirty-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •