Base | Representation |
---|---|
bin | 1101011010100100011101… |
… | …0101011101001100011111 |
3 | 1221020002121211200210112011 |
4 | 3112221013111131030133 |
5 | 3413131213303021112 |
6 | 51212035320052051 |
7 | 3051442405410145 |
oct | 326510725351437 |
9 | 57202554623464 |
10 | 14750114501407 |
11 | 477754111299a |
12 | 17a2807604027 |
13 | 82cc11ab0acc |
14 | 38dca338b595 |
15 | 1a8a3e916aa7 |
hex | d6a4755d31f |
14750114501407 has 4 divisors (see below), whose sum is σ = 14750980796376. Its totient is φ = 14749248206440.
The previous prime is 14750114501393. The next prime is 14750114501411. The reversal of 14750114501407 is 70410541105741.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14750114501407 is a prime.
It is a super-5 number, since 5×147501145014075 (a number of 67 digits) contains 55555 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14750114501407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14750114501497) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 433121944 + ... + 433155997.
It is an arithmetic number, because the mean of its divisors is an integer number (3687745199094).
Almost surely, 214750114501407 is an apocalyptic number.
14750114501407 is a deficient number, since it is larger than the sum of its proper divisors (866294969).
14750114501407 is an equidigital number, since it uses as much as digits as its factorization.
14750114501407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 866294968.
The product of its (nonzero) digits is 78400, while the sum is 40.
The spelling of 14750114501407 in words is "fourteen trillion, seven hundred fifty billion, one hundred fourteen million, five hundred one thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •