Base | Representation |
---|---|
bin | 111110000110111001… |
… | …1001010110001111001 |
3 | 110202021011112120220021 |
4 | 1330031303022301321 |
5 | 4141123112102411 |
6 | 141134415530441 |
7 | 12431112034243 |
oct | 1741563126171 |
9 | 422234476807 |
10 | 133375503481 |
11 | 51622aa3930 |
12 | 21a23229a21 |
13 | c76730167c |
14 | 66538db093 |
15 | 370937ca71 |
hex | 1f0dccac79 |
133375503481 has 4 divisors (see below), whose sum is σ = 145500549264. Its totient is φ = 121250457700.
The previous prime is 133375503463. The next prime is 133375503523. The reversal of 133375503481 is 184305573331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 133375503481 - 213 = 133375495289 is a prime.
It is a super-2 number, since 2×1333755034812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133375503461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6062522875 + ... + 6062522896.
It is an arithmetic number, because the mean of its divisors is an integer number (36375137316).
Almost surely, 2133375503481 is an apocalyptic number.
133375503481 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133375503481 is a deficient number, since it is larger than the sum of its proper divisors (12125045783).
133375503481 is a wasteful number, since it uses less digits than its factorization.
133375503481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12125045782.
The product of its (nonzero) digits is 453600, while the sum is 43.
The spelling of 133375503481 in words is "one hundred thirty-three billion, three hundred seventy-five million, five hundred three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •