Base | Representation |
---|---|
bin | 11011100000100000… |
… | …10100100001100000 |
3 | 1102010020000201220000 |
4 | 31300100110201200 |
5 | 220221131302243 |
6 | 10441234220000 |
7 | 1031653604421 |
oct | 156020244140 |
9 | 42106021800 |
10 | 14768228448 |
11 | 6299309686 |
12 | 2a41a24600 |
13 | 151481961c |
14 | a01531648 |
15 | 5b67d15d3 |
hex | 370414860 |
14768228448 has 60 divisors (see below), whose sum is σ = 43432957260. Its totient is φ = 4922741952.
The previous prime is 14768228443. The next prime is 14768228459. The reversal of 14768228448 is 84482286741.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 14768228394 and 14768228403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14768228443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2846218 + ... + 2851401.
It is an arithmetic number, because the mean of its divisors is an integer number (723882621).
Almost surely, 214768228448 is an apocalyptic number.
14768228448 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
14768228448 is an abundant number, since it is smaller than the sum of its proper divisors (28664728812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14768228448 is an equidigital number, since it uses as much as digits as its factorization.
14768228448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5697641 (or 5697624 counting only the distinct ones).
The product of its digits is 5505024, while the sum is 54.
The spelling of 14768228448 in words is "fourteen billion, seven hundred sixty-eight million, two hundred twenty-eight thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •