Base | Representation |
---|---|
bin | 1100000100010110000110… |
… | …0010010010000110110011 |
3 | 1201222111001210222021202221 |
4 | 3001011201202102012303 |
5 | 3214343440312314410 |
6 | 44115333110421511 |
7 | 2536431665044354 |
oct | 301054142220663 |
9 | 51874053867687 |
10 | 13268790354355 |
11 | 4256298269318 |
12 | 15a36b7061897 |
13 | 75331a931283 |
14 | 33c2da1dbd2b |
15 | 180241e284da |
hex | c11618921b3 |
13268790354355 has 8 divisors (see below), whose sum is σ = 15928469805600. Its totient is φ = 10611084696576.
The previous prime is 13268790354343. The next prime is 13268790354389. The reversal of 13268790354355 is 55345309786231.
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 13268790354355 - 237 = 13131351400883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13268790354293 and 13268790354302.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 493433575 + ... + 493460464.
It is an arithmetic number, because the mean of its divisors is an integer number (1991058725700).
It is a 1-persistent number, because it is pandigital, but 2⋅13268790354355 = 26537580708710 is not.
Almost surely, 213268790354355 is an apocalyptic number.
13268790354355 is a deficient number, since it is larger than the sum of its proper divisors (2659679451245).
13268790354355 is an equidigital number, since it uses as much as digits as its factorization.
13268790354355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 986896733.
The product of its (nonzero) digits is 81648000, while the sum is 61.
The spelling of 13268790354355 in words is "thirteen trillion, two hundred sixty-eight billion, seven hundred ninety million, three hundred fifty-four thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •