Base | Representation |
---|---|
bin | 11010010101010001… |
… | …11010110000110000 |
3 | 1100111020112020110201 |
4 | 31022220322300300 |
5 | 212423102023240 |
6 | 10254452004544 |
7 | 1010221504240 |
oct | 151250726060 |
9 | 40436466421 |
10 | 14137142320 |
11 | 5aa50592a4 |
12 | 28a6600754 |
13 | 1443b58592 |
14 | 9817b5b20 |
15 | 57b1c2d9a |
hex | 34aa3ac30 |
14137142320 has 80 divisors (see below), whose sum is σ = 37730227968. Its totient is φ = 4825624320.
The previous prime is 14137142273. The next prime is 14137142321. The reversal of 14137142320 is 2324173141.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (14137142321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71515 + ... + 182725.
Almost surely, 214137142320 is an apocalyptic number.
14137142320 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 14137142320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18865113984).
14137142320 is an abundant number, since it is smaller than the sum of its proper divisors (23593085648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14137142320 is a wasteful number, since it uses less digits than its factorization.
14137142320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111458 (or 111452 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 28.
The spelling of 14137142320 in words is "fourteen billion, one hundred thirty-seven million, one hundred forty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •