Base | Representation |
---|---|
bin | 10110110011011001… |
… | …11100100001001010 |
3 | 1011121012011222011110 |
4 | 23121230330201022 |
5 | 200033021411212 |
6 | 5342444311150 |
7 | 612243310431 |
oct | 133154744112 |
9 | 34535158143 |
10 | 12242372682 |
11 | 5212555881 |
12 | 2457b424b6 |
13 | 1201436607 |
14 | 841cb0118 |
15 | 4b9b99a3c |
hex | 2d9b3c84a |
12242372682 has 8 divisors (see below), whose sum is σ = 24484745376. Its totient is φ = 4080790892.
The previous prime is 12242372647. The next prime is 12242372689. The reversal of 12242372682 is 28627324221.
12242372682 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
12242372682 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 12242372682.
It is not an unprimeable number, because it can be changed into a prime (12242372689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1020197718 + ... + 1020197729.
It is an arithmetic number, because the mean of its divisors is an integer number (3060593172).
Almost surely, 212242372682 is an apocalyptic number.
12242372682 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12242372682 is a wasteful number, since it uses less digits than its factorization.
12242372682 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2040395452.
The product of its digits is 129024, while the sum is 39.
The spelling of 12242372682 in words is "twelve billion, two hundred forty-two million, three hundred seventy-two thousand, six hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •