Base | Representation |
---|---|
bin | 1100111011101111101011… |
… | …1001100001011111000000 |
3 | 1212100110201122210101000110 |
4 | 3032323322321201133000 |
5 | 3330442142042224440 |
6 | 50124455255151320 |
7 | 2665254341142423 |
oct | 316737271413700 |
9 | 55313648711013 |
10 | 14220551133120 |
11 | 45929a1427322 |
12 | 1718055975540 |
13 | 7c1cb8b96c07 |
14 | 3723c7adb9ba |
15 | 199d986a7080 |
hex | ceefae617c0 |
14220551133120 has 112 divisors (see below), whose sum is σ = 45150994592928. Its totient is φ = 3792084418560.
The previous prime is 14220551133119. The next prime is 14220551133233. The reversal of 14220551133120 is 2133115502241.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107047540 + ... + 107180300.
It is an arithmetic number, because the mean of its divisors is an integer number (403133880294).
Almost surely, 214220551133120 is an apocalyptic number.
14220551133120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14220551133120 is an abundant number, since it is smaller than the sum of its proper divisors (30930443459808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14220551133120 is a wasteful number, since it uses less digits than its factorization.
14220551133120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244358 (or 244348 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 14220551133120 its reverse (2133115502241), we get a palindrome (16353666635361).
The spelling of 14220551133120 in words is "fourteen trillion, two hundred twenty billion, five hundred fifty-one million, one hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •