Base | Representation |
---|---|
bin | 1100000110010100011111… |
… | …1010110011101011000011 |
3 | 1202002201122110011211100212 |
4 | 3001211013322303223003 |
5 | 3220422432400022201 |
6 | 44143104011304335 |
7 | 2542042544664560 |
oct | 301450772635303 |
9 | 52081573154325 |
10 | 13302720314051 |
11 | 42697198a8223 |
12 | 15aa1a614b0ab |
13 | 756597263abc |
14 | 33dbd8567867 |
15 | 18107aa8eabb |
hex | c1947eb3ac3 |
13302720314051 has 8 divisors (see below), whose sum is σ = 15203583439200. Its totient is φ = 11401975816128.
The previous prime is 13302720314011. The next prime is 13302720314053. The reversal of 13302720314051 is 15041302720331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13302720314051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13302720313999 and 13302720314017.
It is not an unprimeable number, because it can be changed into a prime (13302720314053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29416376 + ... + 29865173.
It is an arithmetic number, because the mean of its divisors is an integer number (1900447929900).
Almost surely, 213302720314051 is an apocalyptic number.
13302720314051 is a deficient number, since it is larger than the sum of its proper divisors (1900863125149).
13302720314051 is an equidigital number, since it uses as much as digits as its factorization.
13302720314051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59313613.
The product of its (nonzero) digits is 15120, while the sum is 32.
The spelling of 13302720314051 in words is "thirteen trillion, three hundred two billion, seven hundred twenty million, three hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.206 sec. • engine limits •