Base | Representation |
---|---|
bin | 11010011001111000… |
… | …11011010100010100 |
3 | 1100120221021210200222 |
4 | 31030330123110110 |
5 | 213013001421321 |
6 | 10302352453512 |
7 | 1011201255365 |
oct | 151474332424 |
9 | 40527253628 |
10 | 14175810836 |
11 | 601496a550 |
12 | 28b754a298 |
13 | 144bb77065 |
14 | 98699db6c |
15 | 57e7b03ab |
hex | 34cf1b514 |
14175810836 has 12 divisors (see below), whose sum is σ = 27062911680. Its totient is φ = 6443550360.
The previous prime is 14175810809. The next prime is 14175810877. The reversal of 14175810836 is 63801857141.
14175810836 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-2 number, since 2×141758108362 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44), and also a Moran number because the ratio is a prime number: 322177519 = 14175810836 / (1 + 4 + 1 + 7 + 5 + 8 + 1 + 0 + 8 + 3 + 6).
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 3 ways as a sum of consecutive naturals, for example, 161088716 + ... + 161088803.
It is an arithmetic number, because the mean of its divisors is an integer number (2255242640).
Almost surely, 214175810836 is an apocalyptic number.
It is an amenable number.
14175810836 is a deficient number, since it is larger than the sum of its proper divisors (12887100844).
14175810836 is a wasteful number, since it uses less digits than its factorization.
14175810836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322177534 (or 322177532 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 44.
The spelling of 14175810836 in words is "fourteen billion, one hundred seventy-five million, eight hundred ten thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •