Base | Representation |
---|---|
bin | 111101111110101100… |
… | …1000011001111101101 |
3 | 110201112222112210220102 |
4 | 1323331121003033231 |
5 | 4140042124041141 |
6 | 141051223400445 |
7 | 12421230133526 |
oct | 1737531031755 |
9 | 421488483812 |
10 | 133100221421 |
11 | 514a16723a2 |
12 | 21966bb3125 |
13 | c72227958b |
14 | 662911d84d |
15 | 36e010299b |
hex | 1efd6433ed |
133100221421 has 4 divisors (see below), whose sum is σ = 134344148832. Its totient is φ = 131856294012.
The previous prime is 133100221411. The next prime is 133100221433. The reversal of 133100221421 is 124122001331.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133100221421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133100221393 and 133100221402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133100221411) 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, 621963545 + ... + 621963758.
It is an arithmetic number, because the mean of its divisors is an integer number (33586037208).
Almost surely, 2133100221421 is an apocalyptic number.
It is an amenable number.
133100221421 is a deficient number, since it is larger than the sum of its proper divisors (1243927411).
133100221421 is a wasteful number, since it uses less digits than its factorization.
133100221421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1243927410.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 133100221421 its reverse (124122001331), we get a palindrome (257222222752).
The spelling of 133100221421 in words is "one hundred thirty-three billion, one hundred million, two hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •