Base | Representation |
---|---|
bin | 110010110001101000101000… |
… | …100100101101011010000000 |
3 | 1002021200112102120210122021221 |
4 | 302301220220210231122000 |
5 | 213232230423314100112 |
6 | 2110540401134524424 |
7 | 65015563346250346 |
oct | 6261505044553200 |
9 | 1067615376718257 |
10 | 223313210300032 |
11 | 651776674a6296 |
12 | 2106771a366714 |
13 | 977b464a25698 |
14 | 3d205ba549996 |
15 | 1ac3d5096ae07 |
hex | cb1a2892d680 |
223313210300032 has 32 divisors (see below), whose sum is σ = 447545748978720. Its totient is φ = 110988002713344.
The previous prime is 223313210300021. The next prime is 223313210300069. The reversal of 223313210300032 is 230003012313322.
It is a tau number, because it is divible by the number of its divisors (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5223435078 + ... + 5223477829.
It is an arithmetic number, because the mean of its divisors is an integer number (13985804655585).
Almost surely, 2223313210300032 is an apocalyptic number.
It is an amenable number.
223313210300032 is an abundant number, since it is smaller than the sum of its proper divisors (224232538678688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
223313210300032 is a wasteful number, since it uses less digits than its factorization.
223313210300032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10446913088 (or 10446913076 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 223313210300032 its reverse (230003012313322), we get a palindrome (453316222613354).
The spelling of 223313210300032 in words is "two hundred twenty-three trillion, three hundred thirteen billion, two hundred ten million, three hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •