Base | Representation |
---|---|
bin | 1101000000011000001001… |
… | …0111011001100001010111 |
3 | 1212122002010212200100011012 |
4 | 3100012002113121201113 |
5 | 3333243133111102221 |
6 | 50225220205202435 |
7 | 3004102430330525 |
oct | 320060227314127 |
9 | 55562125610135 |
10 | 14300133300311 |
11 | 461371a498431 |
12 | 172b56586041b |
13 | 7c965c585581 |
14 | 3761b718d315 |
15 | 19bea513d65b |
hex | d01825d9857 |
14300133300311 has 8 divisors (see below), whose sum is σ = 15145610649120. Its totient is φ = 13455132955648.
The previous prime is 14300133300287. The next prime is 14300133300419. The reversal of 14300133300311 is 11300333100341.
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 14300133300311 - 226 = 14300066191447 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14300153300311) 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 7 ways as a sum of consecutive naturals, for example, 119189306 + ... + 119309223.
It is an arithmetic number, because the mean of its divisors is an integer number (1893201331140).
Almost surely, 214300133300311 is an apocalyptic number.
14300133300311 is a deficient number, since it is larger than the sum of its proper divisors (845477348809).
14300133300311 is a wasteful number, since it uses less digits than its factorization.
14300133300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238502073.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 14300133300311 its reverse (11300333100341), we get a palindrome (25600466400652).
The spelling of 14300133300311 in words is "fourteen trillion, three hundred billion, one hundred thirty-three million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •