Base | Representation |
---|---|
bin | 11010101000011100… |
… | …11100100100010111 |
3 | 1100220110011101111222 |
4 | 31110032130210113 |
5 | 213240240200223 |
6 | 10322435120555 |
7 | 1014213532331 |
oct | 152416344427 |
9 | 40813141458 |
10 | 14297975063 |
11 | 607791a319 |
12 | 293044315b |
13 | 146b27b098 |
14 | 998cc0451 |
15 | 58a3920c8 |
hex | 35439c917 |
14297975063 has 4 divisors (see below), whose sum is σ = 14298260040. Its totient is φ = 14297690088.
The previous prime is 14297975053. The next prime is 14297975077. The reversal of 14297975063 is 36057979241.
14297975063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14297975063 - 228 = 14029539607 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14297974996 and 14297975014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14297975023) 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 3 ways as a sum of consecutive naturals, for example, 44993 + ... + 174986.
It is an arithmetic number, because the mean of its divisors is an integer number (3574565010).
Almost surely, 214297975063 is an apocalyptic number.
14297975063 is a deficient number, since it is larger than the sum of its proper divisors (284977).
14297975063 is an equidigital number, since it uses as much as digits as its factorization.
14297975063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284976.
The product of its (nonzero) digits is 2857680, while the sum is 53.
The spelling of 14297975063 in words is "fourteen billion, two hundred ninety-seven million, nine hundred seventy-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •