Base | Representation |
---|---|
bin | 11110011000100101000110… |
… | …100000001001111110000111 |
3 | 122112010221200022212011021000 |
4 | 132120211012200021332013 |
5 | 120003400231040040030 |
6 | 1152113000535224343 |
7 | 40101325241211024 |
oct | 3630450640117607 |
9 | 575127608764230 |
10 | 133630500315015 |
11 | 39640416762610 |
12 | 12ba25a02180b3 |
13 | 59743c096cc62 |
14 | 24dda71dbc54b |
15 | 106b081660860 |
hex | 798946809f87 |
133630500315015 has 128 divisors (see below), whose sum is σ = 259487648640000. Its totient is φ = 64709214474240.
The previous prime is 133630500314963. The next prime is 133630500315029. The reversal of 133630500315015 is 510513005036331.
133630500315015 is a `hidden beast` number, since 1 + 3 + 3 + 63 + 0 + 500 + 31 + 50 + 15 = 666.
It is not a de Polignac number, because 133630500315015 - 210 = 133630500313991 is a prime.
It is a super-2 number, since 2×1336305003150152 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 7085758656 + ... + 7085777514.
It is an arithmetic number, because the mean of its divisors is an integer number (2027247255000).
Almost surely, 2133630500315015 is an apocalyptic number.
133630500315015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
133630500315015 is a deficient number, since it is larger than the sum of its proper divisors (125857148324985).
133630500315015 is a wasteful number, since it uses less digits than its factorization.
133630500315015 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24622 (or 24616 counting only the distinct ones).
The product of its (nonzero) digits is 60750, while the sum is 36.
The spelling of 133630500315015 in words is "one hundred thirty-three trillion, six hundred thirty billion, five hundred million, three hundred fifteen thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •