Base | Representation |
---|---|
bin | 110010101101010011010100… |
… | …110011110100100101001101 |
3 | 1002020122001212022110120001122 |
4 | 302231103110303310211031 |
5 | 213212341121232411023 |
6 | 2110151515010050325 |
7 | 64655222543366600 |
oct | 6255232463644515 |
9 | 1066561768416048 |
10 | 223015452232013 |
11 | 6507235a869741 |
12 | 21019a7b8799a5 |
13 | 975936151a45c |
14 | 3d1001107c337 |
15 | 1abb22500d2c8 |
hex | cad4d4cf494d |
223015452232013 has 12 divisors (see below), whose sum is σ = 260060432070780. Its totient is φ = 190688727563712.
The previous prime is 223015452231973. The next prime is 223015452232021. The reversal of 223015452232013 is 310232254510322.
It can be written as a sum of positive squares in 2 ways, for example, as 83710733513449 + 139304718718564 = 9149357^2 + 11802742^2 .
It is not a de Polignac number, because 223015452232013 - 222 = 223015448037709 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223015452202013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5563960106 + ... + 5564000187.
It is an arithmetic number, because the mean of its divisors is an integer number (21671702672565).
Almost surely, 2223015452232013 is an apocalyptic number.
It is an amenable number.
223015452232013 is a deficient number, since it is larger than the sum of its proper divisors (37044979838767).
223015452232013 is a wasteful number, since it uses less digits than its factorization.
223015452232013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11127960716 (or 11127960709 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 35.
The spelling of 223015452232013 in words is "two hundred twenty-three trillion, fifteen billion, four hundred fifty-two million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •