Base | Representation |
---|---|
bin | 11010010110011100… |
… | …00001111111000000 |
3 | 1100111220211112000210 |
4 | 31023032001333000 |
5 | 212433044334412 |
6 | 10255440314120 |
7 | 1010400264354 |
oct | 151316017700 |
9 | 40456745023 |
10 | 14146871232 |
11 | 5aaa5a381a |
12 | 28a9912940 |
13 | 1445b83930 |
14 | 982bc9464 |
15 | 57be9583c |
hex | 34b381fc0 |
14146871232 has 224 divisors, whose sum is σ = 43116300864. Its totient is φ = 4055040000.
The previous prime is 14146871171. The next prime is 14146871237. The reversal of 14146871232 is 23217864141.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14146871237) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4283982 + ... + 4287282.
It is an arithmetic number, because the mean of its divisors is an integer number (192483486).
Almost surely, 214146871232 is an apocalyptic number.
14146871232 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 14146871232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21558150432).
14146871232 is an abundant number, since it is smaller than the sum of its proper divisors (28969429632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14146871232 is a wasteful number, since it uses less digits than its factorization.
14146871232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3447 (or 3437 counting only the distinct ones).
The product of its digits is 64512, while the sum is 39.
The spelling of 14146871232 in words is "fourteen billion, one hundred forty-six million, eight hundred seventy-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •