Base | Representation |
---|---|
bin | 11010011100110001… |
… | …11001011011101001 |
3 | 1100122121220100112212 |
4 | 31032120321123221 |
5 | 213040203121213 |
6 | 10305020214505 |
7 | 1011614305601 |
oct | 151630713351 |
9 | 40577810485 |
10 | 14200051433 |
11 | 60276168a7 |
12 | 290369a435 |
13 | 1453bb36c9 |
14 | 989cadc01 |
15 | 58199c9a8 |
hex | 34e6396e9 |
14200051433 has 4 divisors (see below), whose sum is σ = 14254044288. Its totient is φ = 14146058580.
The previous prime is 14200051423. The next prime is 14200051457. The reversal of 14200051433 is 33415000241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14200051433 - 216 = 14199985897 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14200051399 and 14200051408.
It is not an unprimeable number, because it can be changed into a prime (14200051423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26996033 + ... + 26996558.
It is an arithmetic number, because the mean of its divisors is an integer number (3563511072).
Almost surely, 214200051433 is an apocalyptic number.
It is an amenable number.
14200051433 is a deficient number, since it is larger than the sum of its proper divisors (53992855).
14200051433 is an equidigital number, since it uses as much as digits as its factorization.
14200051433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53992854.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 14200051433 its reverse (33415000241), we get a palindrome (47615051674).
The spelling of 14200051433 in words is "fourteen billion, two hundred million, fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •