Base | Representation |
---|---|
bin | 11010010100110100… |
… | …10011110000010111 |
3 | 1100110222022122222211 |
4 | 31022122103300113 |
5 | 212421112000120 |
6 | 10254233534251 |
7 | 1010144113546 |
oct | 151232236027 |
9 | 40428278884 |
10 | 14133312535 |
11 | 5aa2982991 |
12 | 28a5274387 |
13 | 1443117334 |
14 | 98109a15d |
15 | 57abb825a |
hex | 34a693c17 |
14133312535 has 8 divisors (see below), whose sum is σ = 16971374160. Its totient is φ = 11299050624.
The previous prime is 14133312463. The next prime is 14133312563. The reversal of 14133312535 is 53521333141.
It is a happy number.
14133312535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14133312535 - 211 = 14133310487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14133312497 and 14133312506.
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, 941737 + ... + 956626.
It is an arithmetic number, because the mean of its divisors is an integer number (2121421770).
Almost surely, 214133312535 is an apocalyptic number.
14133312535 is a deficient number, since it is larger than the sum of its proper divisors (2838061625).
14133312535 is a wasteful number, since it uses less digits than its factorization.
14133312535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1899857.
The product of its digits is 16200, while the sum is 31.
Adding to 14133312535 its reverse (53521333141), we get a palindrome (67654645676).
The spelling of 14133312535 in words is "fourteen billion, one hundred thirty-three million, three hundred twelve thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •