Base | Representation |
---|---|
bin | 111101111100110010… |
… | …1010011111000010101 |
3 | 110201101112022121102221 |
4 | 1323321211103320111 |
5 | 4134424244421141 |
6 | 141041022102341 |
7 | 12416523054655 |
oct | 1737145237025 |
9 | 421345277387 |
10 | 133036326421 |
11 | 514695a1109 |
12 | 2194971a9b1 |
13 | c711c6779b |
14 | 662084a365 |
15 | 36d96d0bd1 |
hex | 1ef9953e15 |
133036326421 has 4 divisors (see below), whose sum is σ = 133049214144. Its totient is φ = 133023438700.
The previous prime is 133036326419. The next prime is 133036326503. The reversal of 133036326421 is 124623630331.
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: 124623630331 = 15527 ⋅8026253.
It is a cyclic number.
It is not a de Polignac number, because 133036326421 - 21 = 133036326419 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133036321421) 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, 6428365 + ... + 6449026.
It is an arithmetic number, because the mean of its divisors is an integer number (33262303536).
Almost surely, 2133036326421 is an apocalyptic number.
It is an amenable number.
133036326421 is a deficient number, since it is larger than the sum of its proper divisors (12887723).
133036326421 is a wasteful number, since it uses less digits than its factorization.
133036326421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12887722.
The product of its (nonzero) digits is 46656, while the sum is 34.
Adding to 133036326421 its reverse (124623630331), we get a palindrome (257659956752).
The spelling of 133036326421 in words is "one hundred thirty-three billion, thirty-six million, three hundred twenty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •