Base | Representation |
---|---|
bin | 1100111110111011011… |
… | …0001001010101101011 |
3 | 210022201202212120220102 |
4 | 3033232312021111223 |
5 | 12123301412103111 |
6 | 250245030220015 |
7 | 22054253666132 |
oct | 3175666112553 |
9 | 708652776812 |
10 | 223050503531 |
11 | 86660215719 |
12 | 3728b1b460b |
13 | 180589b198b |
14 | ab1d598919 |
15 | 5c06e0d13b |
hex | 33eed8956b |
223050503531 has 16 divisors (see below), whose sum is σ = 230373936000. Its totient is φ = 215849650368.
The previous prime is 223050503483. The next prime is 223050503539. The reversal of 223050503531 is 135305050322.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-223050503531 is a prime.
It is a super-2 number, since 2×2230505035312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223050503494 and 223050503503.
It is not an unprimeable number, because it can be changed into a prime (223050503539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6001895 + ... + 6038943.
It is an arithmetic number, because the mean of its divisors is an integer number (14398371000).
Almost surely, 2223050503531 is an apocalyptic number.
223050503531 is a deficient number, since it is larger than the sum of its proper divisors (7323432469).
223050503531 is a wasteful number, since it uses less digits than its factorization.
223050503531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38698.
The product of its (nonzero) digits is 13500, while the sum is 29.
Adding to 223050503531 its reverse (135305050322), we get a palindrome (358355553853).
The spelling of 223050503531 in words is "two hundred twenty-three billion, fifty million, five hundred three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •