Base | Representation |
---|---|
bin | 111110000010000101… |
… | …1011110001000000101 |
3 | 110201211220211112201102 |
4 | 1330010023132020011 |
5 | 4140310302231041 |
6 | 141110412305445 |
7 | 12424112120120 |
oct | 1740413361005 |
9 | 421756745642 |
10 | 133214102021 |
11 | 5154a9845a0 |
12 | 21999172285 |
13 | c73ca40050 |
14 | 663a2c53b7 |
15 | 36ea0ea09b |
hex | 1f042de205 |
133214102021 has 32 divisors (see below), whose sum is σ = 178892679168. Its totient is φ = 95801307840.
The previous prime is 133214102011. The next prime is 133214102027. The reversal of 133214102021 is 120201412331.
It is not a de Polignac number, because 133214102021 - 226 = 133146993157 is a prime.
It is a super-2 number, since 2×1332141020212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133214101984 and 133214102002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133214102027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9229016 + ... + 9243438.
It is an arithmetic number, because the mean of its divisors is an integer number (5590396224).
Almost surely, 2133214102021 is an apocalyptic number.
133214102021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133214102021 is a deficient number, since it is larger than the sum of its proper divisors (45678577147).
133214102021 is a wasteful number, since it uses less digits than its factorization.
133214102021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23681.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 133214102021 its reverse (120201412331), we get a palindrome (253415514352).
The spelling of 133214102021 in words is "one hundred thirty-three billion, two hundred fourteen million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •