Base | Representation |
---|---|
bin | 11010011000011001… |
… | …00101010001001000 |
3 | 1100120001200121002200 |
4 | 31030030211101020 |
5 | 213001244044210 |
6 | 10301224000200 |
7 | 1010656540341 |
oct | 151414452110 |
9 | 40501617080 |
10 | 14163268680 |
11 | 6008883430 |
12 | 28b3300060 |
13 | 14493a5372 |
14 | 9850570c8 |
15 | 57d6340c0 |
hex | 34c325448 |
14163268680 has 96 divisors (see below), whose sum is σ = 50215239360. Its totient is φ = 3433518720.
The previous prime is 14163268607. The next prime is 14163268681. The reversal of 14163268680 is 8686236141.
14163268680 is a `hidden beast` number, since 1 + 4 + 1 + 632 + 6 + 8 + 6 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (14163268681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1784332 + ... + 1792251.
It is an arithmetic number, because the mean of its divisors is an integer number (523075410).
Almost surely, 214163268680 is an apocalyptic number.
14163268680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14163268680 is an abundant number, since it is smaller than the sum of its proper divisors (36051970680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14163268680 is a wasteful number, since it uses less digits than its factorization.
14163268680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3576611 (or 3576604 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 45.
The spelling of 14163268680 in words is "fourteen billion, one hundred sixty-three million, two hundred sixty-eight thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •