Base | Representation |
---|---|
bin | 1100111011111100100010… |
… | …0111001011010101101001 |
3 | 1212100210122012000102201102 |
4 | 3032333020213023111221 |
5 | 3331021224110232223 |
6 | 50130225544331145 |
7 | 2665436016526364 |
oct | 316771047132551 |
9 | 55323565012642 |
10 | 14224002430313 |
11 | 4594402609a55 |
12 | 1718859773ab5 |
13 | 7c2418c106c0 |
14 | 37263421d0db |
15 | 199eeb693928 |
hex | cefc89cb569 |
14224002430313 has 8 divisors (see below), whose sum is σ = 15318190005888. Its totient is φ = 13129819646544.
The previous prime is 14224002430301. The next prime is 14224002430327. The reversal of 14224002430313 is 31303420042241.
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 14224002430313 - 236 = 14155282953577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14224002430373) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7091906 + ... + 8873732.
It is an arithmetic number, because the mean of its divisors is an integer number (1914773750736).
Almost surely, 214224002430313 is an apocalyptic number.
14224002430313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
14224002430313 is a deficient number, since it is larger than the sum of its proper divisors (1094187575575).
14224002430313 is a wasteful number, since it uses less digits than its factorization.
14224002430313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2395903.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 14224002430313 its reverse (31303420042241), we get a palindrome (45527422472554).
The spelling of 14224002430313 in words is "fourteen trillion, two hundred twenty-four billion, two million, four hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •