Base | Representation |
---|---|
bin | 111101111011110011… |
… | …0101011100101010111 |
3 | 110201022012212010012011 |
4 | 1323313212223211113 |
5 | 4134342300144343 |
6 | 141033434405051 |
7 | 12415640650654 |
oct | 1736746534527 |
9 | 421265763164 |
10 | 133003131223 |
11 | 51451889066 |
12 | 2193a590787 |
13 | c708114361 |
14 | 661a288c2b |
15 | 36d682529d |
hex | 1ef79ab957 |
133003131223 has 4 divisors (see below), whose sum is σ = 133559629920. Its totient is φ = 132446632528.
The previous prime is 133003131193. The next prime is 133003131227. The reversal of 133003131223 is 322131300331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322131300331 = 14771 ⋅21808361.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133003131223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133003131194 and 133003131203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133003131227) 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, 278248990 + ... + 278249467.
It is an arithmetic number, because the mean of its divisors is an integer number (33389907480).
Almost surely, 2133003131223 is an apocalyptic number.
133003131223 is a deficient number, since it is larger than the sum of its proper divisors (556498697).
133003131223 is an equidigital number, since it uses as much as digits as its factorization.
133003131223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556498696.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 133003131223 its reverse (322131300331), we get a palindrome (455134431554).
The spelling of 133003131223 in words is "one hundred thirty-three billion, three million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •