Base | Representation |
---|---|
bin | 11010100000010111… |
… | …01011110101011100 |
3 | 1100201201112010110102 |
4 | 31100023223311130 |
5 | 213120404023200 |
6 | 10312013200232 |
7 | 1012431133223 |
oct | 152013536534 |
9 | 40651463412 |
10 | 14230142300 |
11 | 60425a9590 |
12 | 2911790078 |
13 | 145a1bab5a |
14 | 98dca3cba |
15 | 5844436d5 |
hex | 3502ebd5c |
14230142300 has 72 divisors (see below), whose sum is σ = 33714008832. Its totient is φ = 5170392000.
The previous prime is 14230142249. The next prime is 14230142309. The reversal of 14230142300 is 324103241.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14230142309) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1560755 + ... + 1569845.
Almost surely, 214230142300 is an apocalyptic number.
14230142300 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 14230142300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16857004416).
14230142300 is an abundant number, since it is smaller than the sum of its proper divisors (19483866532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14230142300 is a wasteful number, since it uses less digits than its factorization.
14230142300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10539 (or 10532 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 14230142300 its reverse (324103241), we get a palindrome (14554245541).
The spelling of 14230142300 in words is "fourteen billion, two hundred thirty million, one hundred forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •