Base | Representation |
---|---|
bin | 111110010100010101… |
… | …0111011001011110001 |
3 | 110210102120211210220001 |
4 | 1330220222323023301 |
5 | 4143034014433111 |
6 | 141251242350001 |
7 | 12445225004323 |
oct | 1745052731361 |
9 | 423376753801 |
10 | 133826327281 |
11 | 51834522489 |
12 | 21b2a1bb301 |
13 | c80982930a |
14 | 6697731613 |
15 | 3733c301c1 |
hex | 1f28abb2f1 |
133826327281 has 4 divisors (see below), whose sum is σ = 133832326464. Its totient is φ = 133820328100.
The previous prime is 133826327221. The next prime is 133826327303. The reversal of 133826327281 is 182723628331.
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, and also an emirpimes, since its reverse is a distinct semiprime: 182723628331 = 47 ⋅3887736773.
It is a cyclic number.
It is not a de Polignac number, because 133826327281 - 215 = 133826294513 is a prime.
It is a super-2 number, since 2×1338263272812 (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 (133826327221) 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, 2966005 + ... + 3010786.
It is an arithmetic number, because the mean of its divisors is an integer number (33458081616).
Almost surely, 2133826327281 is an apocalyptic number.
It is an amenable number.
133826327281 is a deficient number, since it is larger than the sum of its proper divisors (5999183).
133826327281 is an equidigital number, since it uses as much as digits as its factorization.
133826327281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5999182.
The product of its digits is 580608, while the sum is 46.
The spelling of 133826327281 in words is "one hundred thirty-three billion, eight hundred twenty-six million, three hundred twenty-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •