Base | Representation |
---|---|
bin | 11110001111111001111000… |
… | …111110001110001001100001 |
3 | 122110000221220100110210010020 |
4 | 132033321320332032021201 |
5 | 114414113320212244410 |
6 | 1150535045104224053 |
7 | 40010262061236633 |
oct | 3617717076161141 |
9 | 573027810423106 |
10 | 133034346603105 |
11 | 39430605506202 |
12 | 12b06b4560b029 |
13 | 5930114b3587c |
14 | 24bcc7a8b8a53 |
15 | 105a7de303a70 |
hex | 78fe78f8e261 |
133034346603105 has 32 divisors (see below), whose sum is σ = 218614222041600. Its totient is φ = 69032008518912.
The previous prime is 133034346603089. The next prime is 133034346603121. The reversal of 133034346603105 is 501306643430331.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (133034346603089) and next prime (133034346603121).
It is not a de Polignac number, because 133034346603105 - 24 = 133034346603089 is a prime.
It is a super-2 number, since 2×1330343466031052 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15449631 + ... + 22466859.
It is an arithmetic number, because the mean of its divisors is an integer number (6831694438800).
Almost surely, 2133034346603105 is an apocalyptic number.
133034346603105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
133034346603105 is a deficient number, since it is larger than the sum of its proper divisors (85579875438495).
133034346603105 is a wasteful number, since it uses less digits than its factorization.
133034346603105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7051433.
The product of its (nonzero) digits is 699840, while the sum is 42.
The spelling of 133034346603105 in words is "one hundred thirty-three trillion, thirty-four billion, three hundred forty-six million, six hundred three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •