Base | Representation |
---|---|
bin | 110010101101010000001111… |
… | …100010010010101100010111 |
3 | 1002020121202022122200000212002 |
4 | 302231100033202102230113 |
5 | 213212312331441301312 |
6 | 2110150210335345515 |
7 | 64655044534345610 |
oct | 6255201742225427 |
9 | 1066552278600762 |
10 | 223012142525207 |
11 | 65070a115a4a62 |
12 | 210192b738229b |
13 | 9758c54919b69 |
14 | 3d0dbb9696c07 |
15 | 1abb0ce68e4c2 |
hex | cad40f892b17 |
223012142525207 has 16 divisors (see below), whose sum is σ = 255394297344000. Its totient is φ = 190760844582432.
The previous prime is 223012142525197. The next prime is 223012142525209. The reversal of 223012142525207 is 702525241210322.
It is a cyclic number.
It is not a de Polignac number, because 223012142525207 - 212 = 223012142521111 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 (223012142525209) 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, 70202753 + ... + 73310645.
It is an arithmetic number, because the mean of its divisors is an integer number (15962143584000).
Almost surely, 2223012142525207 is an apocalyptic number.
223012142525207 is a deficient number, since it is larger than the sum of its proper divisors (32382154818793).
223012142525207 is a wasteful number, since it uses less digits than its factorization.
223012142525207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3128942.
The product of its (nonzero) digits is 134400, while the sum is 38.
Adding to 223012142525207 its reverse (702525241210322), we get a palindrome (925537383735529).
The spelling of 223012142525207 in words is "two hundred twenty-three trillion, twelve billion, one hundred forty-two million, five hundred twenty-five thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •