Base | Representation |
---|---|
bin | 1100110010001111001001… |
… | …1011100100110010000101 |
3 | 1211202212002110101122011202 |
4 | 3030203302123210302011 |
5 | 3320303121234313313 |
6 | 45521442204112245 |
7 | 2650412346060011 |
oct | 314436233446205 |
9 | 54685073348152 |
10 | 14057200307333 |
11 | 452a697115157 |
12 | 16b0467b35685 |
13 | 7ac785660a51 |
14 | 36852d17b541 |
15 | 1959d7977558 |
hex | cc8f26e4c85 |
14057200307333 has 4 divisors (see below), whose sum is σ = 14255189044128. Its totient is φ = 13859211570540.
The previous prime is 14057200307323. The next prime is 14057200307377. The reversal of 14057200307333 is 33370300275041.
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 14057200307333 - 24 = 14057200307317 is a prime.
It is a super-3 number, since 3×140572003073333 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14057200307323) 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, 98994368291 + ... + 98994368432.
It is an arithmetic number, because the mean of its divisors is an integer number (3563797261032).
Almost surely, 214057200307333 is an apocalyptic number.
It is an amenable number.
14057200307333 is a deficient number, since it is larger than the sum of its proper divisors (197988736795).
14057200307333 is an equidigital number, since it uses as much as digits as its factorization.
14057200307333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197988736794.
The product of its (nonzero) digits is 158760, while the sum is 38.
The spelling of 14057200307333 in words is "fourteen trillion, fifty-seven billion, two hundred million, three hundred seven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •