Base | Representation |
---|---|
bin | 110010110100100011000001… |
… | …110110110010101110000101 |
3 | 1002022101200000200210200110212 |
4 | 302310203001312302232011 |
5 | 213244020320203400203 |
6 | 2111212340552525205 |
7 | 65036210121411116 |
oct | 6264430166625605 |
9 | 1068350020720425 |
10 | 223513350450053 |
11 | 65244530391254 |
12 | 2109a4749b0805 |
13 | 97942ac0a5261 |
14 | 3d2a1650b020d |
15 | 1ac91663761d8 |
hex | cb48c1db2b85 |
223513350450053 has 8 divisors (see below), whose sum is σ = 225273736685568. Its totient is φ = 221752971067824.
The previous prime is 223513350450017. The next prime is 223513350450067. The reversal of 223513350450053 is 350054053315322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 223513350450053 - 28 = 223513350449797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223513350450653) 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 7 ways as a sum of consecutive naturals, for example, 78502475 + ... + 81299847.
It is an arithmetic number, because the mean of its divisors is an integer number (28159217085696).
Almost surely, 2223513350450053 is an apocalyptic number.
It is an amenable number.
223513350450053 is a deficient number, since it is larger than the sum of its proper divisors (1760386235515).
223513350450053 is a wasteful number, since it uses less digits than its factorization.
223513350450053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3426643.
The product of its (nonzero) digits is 810000, while the sum is 41.
The spelling of 223513350450053 in words is "two hundred twenty-three trillion, five hundred thirteen billion, three hundred fifty million, four hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •