Base | Representation |
---|---|
bin | 1100111110110110110… |
… | …1010011110111010101 |
3 | 210022200102221112200112 |
4 | 3033231231103313111 |
5 | 12123232020111013 |
6 | 250243105052405 |
7 | 22053632464220 |
oct | 3175555236725 |
9 | 708612845615 |
10 | 223031410133 |
11 | 86650464554 |
12 | 37284927105 |
13 | 18054a580cc |
14 | ab1ac285b7 |
15 | 5c053daba8 |
hex | 33edb53dd5 |
223031410133 has 4 divisors (see below), whose sum is σ = 254893040160. Its totient is φ = 191169780108.
The previous prime is 223031410123. The next prime is 223031410171. The reversal of 223031410133 is 331014130322.
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 not a de Polignac number, because 223031410133 - 224 = 223014632917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223031410099 and 223031410108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223031410103) 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, 15930815003 + ... + 15930815016.
It is an arithmetic number, because the mean of its divisors is an integer number (63723260040).
Almost surely, 2223031410133 is an apocalyptic number.
It is an amenable number.
223031410133 is a deficient number, since it is larger than the sum of its proper divisors (31861630027).
223031410133 is an equidigital number, since it uses as much as digits as its factorization.
223031410133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31861630026.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 223031410133 its reverse (331014130322), we get a palindrome (554045540455).
The spelling of 223031410133 in words is "two hundred twenty-three billion, thirty-one million, four hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •