Base | Representation |
---|---|
bin | 1101010011010110001010… |
… | …1111000011000001100000 |
3 | 1220210020022111021020110011 |
4 | 3110311202233003001200 |
5 | 3404113042124040300 |
6 | 51035033443214304 |
7 | 3036460261644304 |
oct | 324654257030140 |
9 | 56706274236404 |
10 | 14626020143200 |
11 | 4729951086964 |
12 | 1782754677394 |
13 | 8212c658849b |
14 | 387c9036bd04 |
15 | 1a56ca29ceba |
hex | d4d62bc3060 |
14626020143200 has 72 divisors (see below), whose sum is σ = 35706387644928. Its totient is φ = 5850307130880.
The previous prime is 14626020143177. The next prime is 14626020143213. The reversal of 14626020143200 is 234102062641.
It is a super-4 number, since 4×146260201432004 (a number of 54 digits) contains 4444 as substring.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 61114974 + ... + 61353826.
It is an arithmetic number, because the mean of its divisors is an integer number (495922050624).
Almost surely, 214626020143200 is an apocalyptic number.
14626020143200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14626020143200 is an abundant number, since it is smaller than the sum of its proper divisors (21080367501728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14626020143200 is a wasteful number, since it uses less digits than its factorization.
14626020143200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315416 (or 315403 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 31.
The spelling of 14626020143200 in words is "fourteen trillion, six hundred twenty-six billion, twenty million, one hundred forty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •