Base | Representation |
---|---|
bin | 11010011000100111… |
… | …10011000111110000 |
3 | 1100120012020201002120 |
4 | 31030103303013300 |
5 | 213002240113212 |
6 | 10301332314240 |
7 | 1011011606553 |
oct | 151423630760 |
9 | 40505221076 |
10 | 14165160432 |
11 | 6009955765 |
12 | 28b3a72980 |
13 | 14498b8447 |
14 | 9853ca69a |
15 | 57d8a988c |
hex | 34c4f31f0 |
14165160432 has 40 divisors (see below), whose sum is σ = 37855173840. Its totient is φ = 4558901760.
The previous prime is 14165160407. The next prime is 14165160463. The reversal of 14165160432 is 23406156141.
14165160432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14165160393 and 14165160402.
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 7 ways as a sum of consecutive naturals, for example, 5086669 + ... + 5089452.
It is an arithmetic number, because the mean of its divisors is an integer number (946379346).
Almost surely, 214165160432 is an apocalyptic number.
14165160432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14165160432 is an abundant number, since it is smaller than the sum of its proper divisors (23690013408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14165160432 is a wasteful number, since it uses less digits than its factorization.
14165160432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10176161 (or 10176155 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 14165160432 in words is "fourteen billion, one hundred sixty-five million, one hundred sixty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •