Base | Representation |
---|---|
bin | 1011000111011011110001… |
… | …1010111011000100001010 |
3 | 1121021110000002220110120010 |
4 | 2301312330122323010022 |
5 | 3100222324320201102 |
6 | 41554511131012350 |
7 | 2401015025314215 |
oct | 261667432730412 |
9 | 47243002813503 |
10 | 12222343131402 |
11 | 3992515075358 |
12 | 1454931b9a0b6 |
13 | 6a873c980771 |
14 | 3037c924077c |
15 | 162de7ba1d6c |
hex | b1dbc6bb10a |
12222343131402 has 16 divisors (see below), whose sum is σ = 25105353459552. Its totient is φ = 3964003177680.
The previous prime is 12222343131371. The next prime is 12222343131403. The reversal of 12222343131402 is 20413134322221.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 12222343131402.
It is not an unprimeable number, because it can be changed into a prime (12222343131403) 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, 27527799624 + ... + 27527800067.
It is an arithmetic number, because the mean of its divisors is an integer number (1569084591222).
Almost surely, 212222343131402 is an apocalyptic number.
12222343131402 is an abundant number, since it is smaller than the sum of its proper divisors (12883010328150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12222343131402 is a wasteful number, since it uses less digits than its factorization.
12222343131402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55055599733.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 12222343131402 its reverse (20413134322221), we get a palindrome (32635477453623).
The spelling of 12222343131402 in words is "twelve trillion, two hundred twenty-two billion, three hundred forty-three million, one hundred thirty-one thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •