Base | Representation |
---|---|
bin | 111110001000010110… |
… | …1000000111110111111 |
3 | 110202101120012202100011 |
4 | 1330100231000332333 |
5 | 4141223100102033 |
6 | 141143320044051 |
7 | 12432243114202 |
oct | 1742055007677 |
9 | 422346182304 |
10 | 133424222143 |
11 | 51648549993 |
12 | 21a37603627 |
13 | c77442b794 |
14 | 665a17d939 |
15 | 370d7a2ccd |
hex | 1f10b40fbf |
133424222143 has 4 divisors (see below), whose sum is σ = 133626687480. Its totient is φ = 133221756808.
The previous prime is 133424222137. The next prime is 133424222147. The reversal of 133424222143 is 341222424331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341222424331 = 43 ⋅7935405217.
It is a cyclic number.
It is not a de Polignac number, because 133424222143 - 25 = 133424222111 is a prime.
It is a super-2 number, since 2×1334242221432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133424222147) 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, 101231680 + ... + 101232997.
It is an arithmetic number, because the mean of its divisors is an integer number (33406671870).
Almost surely, 2133424222143 is an apocalyptic number.
133424222143 is a deficient number, since it is larger than the sum of its proper divisors (202465337).
133424222143 is an equidigital number, since it uses as much as digits as its factorization.
133424222143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202465336.
The product of its digits is 27648, while the sum is 31.
Adding to 133424222143 its reverse (341222424331), we get a palindrome (474646646474).
The spelling of 133424222143 in words is "one hundred thirty-three billion, four hundred twenty-four million, two hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •