Base | Representation |
---|---|
bin | 111101111111101001… |
… | …0010010001110101111 |
3 | 110201122012100102222011 |
4 | 1323333102102032233 |
5 | 4140123243032343 |
6 | 141054320502051 |
7 | 12422064230113 |
oct | 1737722221657 |
9 | 421565312864 |
10 | 133132002223 |
11 | 515085a9820 |
12 | 2197577a927 |
13 | c728a25c9c |
14 | 662d433743 |
15 | 36e2cce29d |
hex | 1eff4923af |
133132002223 has 4 divisors (see below), whose sum is σ = 145234911528. Its totient is φ = 121029092920.
The previous prime is 133132002209. The next prime is 133132002281. The reversal of 133132002223 is 322200231331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322200231331 = 11 ⋅29290930121.
It is a cyclic number.
It is not a de Polignac number, because 133132002223 - 229 = 132595131311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133132002194 and 133132002203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133132002923) 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, 6051454636 + ... + 6051454657.
It is an arithmetic number, because the mean of its divisors is an integer number (36308727882).
Almost surely, 2133132002223 is an apocalyptic number.
133132002223 is a deficient number, since it is larger than the sum of its proper divisors (12102909305).
133132002223 is a wasteful number, since it uses less digits than its factorization.
133132002223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12102909304.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 133132002223 its reverse (322200231331), we get a palindrome (455332233554).
The spelling of 133132002223 in words is "one hundred thirty-three billion, one hundred thirty-two million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •