Base | Representation |
---|---|
bin | 11010010011101111… |
… | …01101010001010000 |
3 | 1100110100020211120002 |
4 | 31021313231101100 |
5 | 212411301221000 |
6 | 10253311305132 |
7 | 1010004035051 |
oct | 151167552120 |
9 | 40410224502 |
10 | 14124242000 |
11 | 5a98848080 |
12 | 28a221b1a8 |
13 | 144128c85b |
14 | 97dbb8728 |
15 | 579ec58d5 |
hex | 349ded450 |
14124242000 has 80 divisors (see below), whose sum is σ = 37257240384. Its totient is φ = 5136080000.
The previous prime is 14124241973. The next prime is 14124242023. The reversal of 14124242000 is 24242141.
14124242000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 299006 + ... + 343005.
Almost surely, 214124242000 is an apocalyptic number.
14124242000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14124242000 is an abundant number, since it is smaller than the sum of its proper divisors (23132998384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14124242000 is a wasteful number, since it uses less digits than its factorization.
14124242000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642045 (or 642029 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 14124242000 its reverse (24242141), we get a palindrome (14148484141).
The spelling of 14124242000 in words is "fourteen billion, one hundred twenty-four million, two hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •