Base | Representation |
---|---|
bin | 1011000011111100100110… |
… | …0000111010101001110010 |
3 | 1121001201100212220212211020 |
4 | 2300333021200322221302 |
5 | 3043232130403423432 |
6 | 41511202242400310 |
7 | 2363464301664402 |
oct | 260771140725162 |
9 | 47051325825736 |
10 | 12162433264242 |
11 | 396a07155a448 |
12 | 14451b2360096 |
13 | 6a2bb2ac0b21 |
14 | 300944730802 |
15 | 16158d30522c |
hex | b0fc983aa72 |
12162433264242 has 32 divisors (see below), whose sum is σ = 24937019722944. Its totient is φ = 3952268601600.
The previous prime is 12162433264217. The next prime is 12162433264243. The reversal of 12162433264242 is 24246233426121.
12162433264242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×121624332642422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12162433264194 and 12162433264203.
It is not an unprimeable number, because it can be changed into a prime (12162433264243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18388428 + ... + 19038359.
It is an arithmetic number, because the mean of its divisors is an integer number (779281866342).
Almost surely, 212162433264242 is an apocalyptic number.
12162433264242 is an abundant number, since it is smaller than the sum of its proper divisors (12774586458702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12162433264242 is a wasteful number, since it uses less digits than its factorization.
12162433264242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37428154.
The product of its digits is 663552, while the sum is 42.
The spelling of 12162433264242 in words is "twelve trillion, one hundred sixty-two billion, four hundred thirty-three million, two hundred sixty-four thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •