Base | Representation |
---|---|
bin | 11011000010100100… |
… | …00101011111001011 |
3 | 1101110201100200101110 |
4 | 31201102011133023 |
5 | 214212330023112 |
6 | 10400302221403 |
7 | 1022513513046 |
oct | 154122053713 |
9 | 41421320343 |
10 | 14517032907 |
11 | 617a539763 |
12 | 2991884863 |
13 | 14a4778a00 |
14 | 9ba023c5d |
15 | 59e71313c |
hex | 3614857cb |
14517032907 has 18 divisors (see below), whose sum is σ = 20963420796. Its totient is φ = 8931889200.
The previous prime is 14517032861. The next prime is 14517032951. The reversal of 14517032907 is 70923071541.
14517032907 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14517032907 - 210 = 14517031883 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (14517032977) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 2710282 + ... + 2715632.
Almost surely, 214517032907 is an apocalyptic number.
14517032907 is a deficient number, since it is larger than the sum of its proper divisors (6446387889).
14517032907 is an frugal number, since it uses more digits than its factorization.
14517032907 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10731 (or 5367 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 39.
The spelling of 14517032907 in words is "fourteen billion, five hundred seventeen million, thirty-two thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •