Base | Representation |
---|---|
bin | 11010101010010001… |
… | …01100100101001000 |
3 | 1100221111220011221012 |
4 | 31111020230211020 |
5 | 213303142320000 |
6 | 10324142303052 |
7 | 1014460401155 |
oct | 152510544510 |
9 | 40844804835 |
10 | 14313245000 |
11 | 60854a98aa |
12 | 2935587a88 |
13 | 1471496552 |
14 | 99ad3722c |
15 | 58b8ab735 |
hex | 35522c948 |
14313245000 has 160 divisors (see below), whose sum is σ = 35507134080. Its totient is φ = 5396160000.
The previous prime is 14313244993. The next prime is 14313245029. The reversal of 14313245000 is 54231341.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8164124 + ... + 8165876.
It is an arithmetic number, because the mean of its divisors is an integer number (221919588).
Almost surely, 214313245000 is an apocalyptic number.
14313245000 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 14313245000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17753567040).
14313245000 is an abundant number, since it is smaller than the sum of its proper divisors (21193889080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14313245000 is a wasteful number, since it uses less digits than its factorization.
14313245000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1873 (or 1854 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 14313245000 its reverse (54231341), we get a palindrome (14367476341).
The spelling of 14313245000 in words is "fourteen billion, three hundred thirteen million, two hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •