Base | Representation |
---|---|
bin | 11010100101001100… |
… | …11111101110001000 |
3 | 1100211112212221110101 |
4 | 31102212133232020 |
5 | 213211301200000 |
6 | 10320023055144 |
7 | 1013433106150 |
oct | 152246375610 |
9 | 40745787411 |
10 | 14270725000 |
11 | 60634a7a04 |
12 | 29232a14b4 |
13 | 146572999c |
14 | 995429760 |
15 | 587cace6a |
hex | 35299fb88 |
14270725000 has 96 divisors (see below), whose sum is σ = 38223178560. Its totient is φ = 4892760000.
The previous prime is 14270724997. The next prime is 14270725013. The reversal of 14270725000 is 52707241.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 14270725000.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 134227 + ... + 215773.
It is an arithmetic number, because the mean of its divisors is an integer number (398158110).
Almost surely, 214270725000 is an apocalyptic number.
14270725000 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 14270725000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19111589280).
14270725000 is an abundant number, since it is smaller than the sum of its proper divisors (23952453560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14270725000 is an frugal number, since it uses more digits than its factorization.
14270725000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81585 (or 81561 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 28.
The spelling of 14270725000 in words is "fourteen billion, two hundred seventy million, seven hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •