Base | Representation |
---|---|
bin | 1011000010000111110111… |
… | …1010110100001101010110 |
3 | 1120221201111020021000102201 |
4 | 2300201331322310031112 |
5 | 3042223443123322402 |
6 | 41444541150355114 |
7 | 2361304654314112 |
oct | 260417572641526 |
9 | 46851436230381 |
10 | 12131100214102 |
11 | 39578528a5091 |
12 | 143b108abba9a |
13 | 69cc5b4bb67c |
14 | 2dd211240742 |
15 | 16085765d687 |
hex | b087deb4356 |
12131100214102 has 8 divisors (see below), whose sum is σ = 18220880217312. Its totient is φ = 6057473475000.
The previous prime is 12131100214091. The next prime is 12131100214109. The reversal of 12131100214102 is 20141200113121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 12131100214102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12131100214109) 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 3 ways as a sum of consecutive naturals, for example, 4038314149 + ... + 4038317152.
It is an arithmetic number, because the mean of its divisors is an integer number (2277610027164).
Almost surely, 212131100214102 is an apocalyptic number.
12131100214102 is a deficient number, since it is larger than the sum of its proper divisors (6089780003210).
12131100214102 is an equidigital number, since it uses as much as digits as its factorization.
12131100214102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8076632054.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 12131100214102 its reverse (20141200113121), we get a palindrome (32272300327223).
The spelling of 12131100214102 in words is "twelve trillion, one hundred thirty-one billion, one hundred million, two hundred fourteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •