Base | Representation |
---|---|
bin | 1100111010101000011000… |
… | …0111100100110010010000 |
3 | 1212021122022211011100020010 |
4 | 3032222012013210302100 |
5 | 3330133442433410300 |
6 | 50112012201314520 |
7 | 2664006141253116 |
oct | 316520607446220 |
9 | 55248284140203 |
10 | 14201412013200 |
11 | 458586a940245 |
12 | 17143b4195a40 |
13 | 7c0258969899 |
14 | 3714cdcabab6 |
15 | 1996282dba50 |
hex | cea861e4c90 |
14201412013200 has 120 divisors (see below), whose sum is σ = 45494566429248. Its totient is φ = 3786817610240.
The previous prime is 14201412013193. The next prime is 14201412013219. The reversal of 14201412013200 is 231021410241.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×142014120132002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20304514 + ... + 20992286.
Almost surely, 214201412013200 is an apocalyptic number.
14201412013200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14201412013200 is an abundant number, since it is smaller than the sum of its proper divisors (31293154416048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14201412013200 is a wasteful number, since it uses less digits than its factorization.
14201412013200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 705001 (or 704990 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 14201412013200 its reverse (231021410241), we get a palindrome (14432433423441).
The spelling of 14201412013200 in words is "fourteen trillion, two hundred one billion, four hundred twelve million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •