Base | Representation |
---|---|
bin | 1100000111111011010011… |
… | …1111101101110011000101 |
3 | 1202012100212221002021220010 |
4 | 3001332310333231303011 |
5 | 3221400443422333104 |
6 | 44203510423100433 |
7 | 2544040521324252 |
oct | 301766477556305 |
9 | 52170787067803 |
10 | 13330320121029 |
11 | 427a3a220775a |
12 | 15b36092a1719 |
13 | 7590752a3432 |
14 | 341295d02429 |
15 | 181b43b05489 |
hex | c1fb4fedcc5 |
13330320121029 has 8 divisors (see below), whose sum is σ = 17774264108160. Its totient is φ = 8886628107296.
The previous prime is 13330320120983. The next prime is 13330320121039. The reversal of 13330320121029 is 92012102303331.
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 13330320121029 - 28 = 13330320120773 is a prime.
It is a super-2 number, since 2×133303201210292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13330320120987 and 13330320121005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330320121039) 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, 62869872 + ... + 63081545.
It is an arithmetic number, because the mean of its divisors is an integer number (2221783013520).
Almost surely, 213330320121029 is an apocalyptic number.
It is an amenable number.
13330320121029 is a deficient number, since it is larger than the sum of its proper divisors (4443943987131).
13330320121029 is a wasteful number, since it uses less digits than its factorization.
13330320121029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125986699.
The product of its (nonzero) digits is 5832, while the sum is 30.
The spelling of 13330320121029 in words is "thirteen trillion, three hundred thirty billion, three hundred twenty million, one hundred twenty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •