Base | Representation |
---|---|
bin | 11001000010111100… |
… | …00111001011100110 |
3 | 1021201002212010011012 |
4 | 30201132013023212 |
5 | 210014242200000 |
6 | 10102135542222 |
7 | 654133612625 |
oct | 144136071346 |
9 | 37632763135 |
10 | 13446443750 |
11 | 5780192233 |
12 | 273322a972 |
13 | 1363a24abc |
14 | 917b7d6bc |
15 | 53a73b735 |
hex | 3217872e6 |
13446443750 has 48 divisors (see below), whose sum is σ = 26024084352. Its totient is φ = 5205000000.
The previous prime is 13446443741. The next prime is 13446443767. The reversal of 13446443750 is 5734464431.
It is a happy number.
13446443750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×134464437503 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13446443698 and 13446443707.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 159050 + ... + 228450.
It is an arithmetic number, because the mean of its divisors is an integer number (542168424).
Almost surely, 213446443750 is an apocalyptic number.
13446443750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13446443750 is a deficient number, since it is larger than the sum of its proper divisors (12577640602).
13446443750 is an frugal number, since it uses more digits than its factorization.
13446443750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69459 (or 69439 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 41.
The spelling of 13446443750 in words is "thirteen billion, four hundred forty-six million, four hundred forty-three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •