Base | Representation |
---|---|
bin | 11010010010011011… |
… | …01110000000111000 |
3 | 1100102120112121210102 |
4 | 31021031232000320 |
5 | 212400442010000 |
6 | 10252235334532 |
7 | 1006511342504 |
oct | 151115560070 |
9 | 40376477712 |
10 | 14113235000 |
11 | 5a9260a387 |
12 | 289a5b1448 |
13 | 143bc07837 |
14 | 97c551304 |
15 | 57904e3d5 |
hex | 34936e038 |
14113235000 has 80 divisors (see below), whose sum is σ = 33395903640. Its totient is φ = 5589200000.
The previous prime is 14113234969. The next prime is 14113235023. The reversal of 14113235000 is 53231141.
It is a super-3 number, since 3×141132350003 (a number of 31 digits) contains 333 as substring.
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 polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 491027 + ... + 518973.
Almost surely, 214113235000 is an apocalyptic number.
14113235000 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 14113235000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16697951820).
14113235000 is an abundant number, since it is smaller than the sum of its proper divisors (19282668640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14113235000 is a wasteful number, since it uses less digits than its factorization.
14113235000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28074 (or 28055 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 14113235000 its reverse (53231141), we get a palindrome (14166466141).
The spelling of 14113235000 in words is "fourteen billion, one hundred thirteen million, two hundred thirty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •