Base | Representation |
---|---|
bin | 11010000101100011… |
… | …10000010100100100 |
3 | 1100011001022222001020 |
4 | 31002301300110210 |
5 | 212140320203444 |
6 | 10233420531140 |
7 | 1004030404530 |
oct | 150261602444 |
9 | 40131288036 |
10 | 14005241124 |
11 | 5a37658a46 |
12 | 286a3b0ab0 |
13 | 1422725634 |
14 | 96c07cbc0 |
15 | 56e81b119 |
hex | 342c70524 |
14005241124 has 24 divisors (see below), whose sum is σ = 37347309888. Its totient is φ = 4001497440.
The previous prime is 14005241111. The next prime is 14005241141. The reversal of 14005241124 is 42114250041.
It is a super-2 number, since 2×140052411242 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14005241094 and 14005241103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83364447 + ... + 83364614.
It is an arithmetic number, because the mean of its divisors is an integer number (1556137912).
Almost surely, 214005241124 is an apocalyptic number.
14005241124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
14005241124 is an abundant number, since it is smaller than the sum of its proper divisors (23342068764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14005241124 is a wasteful number, since it uses less digits than its factorization.
14005241124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166729075 (or 166729073 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 14005241124 its reverse (42114250041), we get a palindrome (56119491165).
The spelling of 14005241124 in words is "fourteen billion, five million, two hundred forty-one thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •