Base | Representation |
---|---|
bin | 11010111001110001… |
… | …11110001011101000 |
3 | 1101021120200201102210 |
4 | 31130320332023220 |
5 | 214034443344040 |
6 | 10345110525120 |
7 | 1020630240330 |
oct | 153470761350 |
9 | 41246621383 |
10 | 14443340520 |
11 | 6141986564 |
12 | 29710667a0 |
13 | 149241664b |
14 | 9b03200c0 |
15 | 598008480 |
hex | 35ce3e2e8 |
14443340520 has 128 divisors (see below), whose sum is σ = 50671779840. Its totient is φ = 3224551680.
The previous prime is 14443340419. The next prime is 14443340579. The reversal of 14443340520 is 2504334441.
It is a super-2 number, since 2×144433405202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 31 ways as a sum of consecutive naturals, for example, 163816 + ... + 236055.
It is an arithmetic number, because the mean of its divisors is an integer number (395873280).
Almost surely, 214443340520 is an apocalyptic number.
14443340520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14443340520 is an abundant number, since it is smaller than the sum of its proper divisors (36228439320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14443340520 is a wasteful number, since it uses less digits than its factorization.
14443340520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399935 (or 399931 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 30.
Adding to 14443340520 its reverse (2504334441), we get a palindrome (16947674961).
The spelling of 14443340520 in words is "fourteen billion, four hundred forty-three million, three hundred forty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •