Base | Representation |
---|---|
bin | 11010011000011001… |
… | …11101000101110100 |
3 | 1100120001212112221202 |
4 | 31030030331011310 |
5 | 213001310210020 |
6 | 10301230032032 |
7 | 1010660425001 |
oct | 151414750564 |
9 | 40501775852 |
10 | 14163366260 |
11 | 600893a77a |
12 | 28b3348618 |
13 | 144940a8c4 |
14 | 9850808a8 |
15 | 57d652e75 |
hex | 34c33d174 |
14163366260 has 48 divisors (see below), whose sum is σ = 31051112400. Its totient is φ = 5419782144.
The previous prime is 14163366253. The next prime is 14163366299. The reversal of 14163366260 is 6266336141.
14163366260 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 89340304 + 14074025956 = 9452^2 + 118634^2 .
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 15 ways as a sum of consecutive naturals, for example, 48797 + ... + 175236.
It is an arithmetic number, because the mean of its divisors is an integer number (646898175).
Almost surely, 214163366260 is an apocalyptic number.
14163366260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14163366260 is an abundant number, since it is smaller than the sum of its proper divisors (16887746140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14163366260 is a wasteful number, since it uses less digits than its factorization.
14163366260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224180 (or 224178 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 38.
The spelling of 14163366260 in words is "fourteen billion, one hundred sixty-three million, three hundred sixty-six thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •