Base | Representation |
---|---|
bin | 110010100011110010110111… |
… | …110011101100100110001011 |
3 | 1002011022121112012121112000201 |
4 | 302203302313303230212023 |
5 | 213121140120420143201 |
6 | 2104531430320513031 |
7 | 64560063613406155 |
oct | 6243626763544613 |
9 | 1064277465545021 |
10 | 222362130631051 |
11 | 64940282855134 |
12 | 20b3332b77b777 |
13 | 970c874916b98 |
14 | 3cca5552a7ad5 |
15 | 1aa9238dcc801 |
hex | ca3cb7cec98b |
222362130631051 has 12 divisors (see below), whose sum is σ = 230772146380248. Its totient is φ = 214215700101984.
The previous prime is 222362130631049. The next prime is 222362130631111. The reversal of 222362130631051 is 150136031263222.
It is not a de Polignac number, because 222362130631051 - 21 = 222362130631049 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 222362130631051.
It is not an unprimeable number, because it can be changed into a prime (222362130631021) 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, 823568805 + ... + 823838758.
It is an arithmetic number, because the mean of its divisors is an integer number (19231012198354).
Almost surely, 2222362130631051 is an apocalyptic number.
222362130631051 is a deficient number, since it is larger than the sum of its proper divisors (8410015749197).
222362130631051 is an equidigital number, since it uses as much as digits as its factorization.
222362130631051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1647407722 (or 1647407679 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 37.
Adding to 222362130631051 its reverse (150136031263222), we get a palindrome (372498161894273).
The spelling of 222362130631051 in words is "two hundred twenty-two trillion, three hundred sixty-two billion, one hundred thirty million, six hundred thirty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •