Base | Representation |
---|---|
bin | 1011100010001100100111… |
… | …1011011000011100011011 |
3 | 1122220101210112100200120020 |
4 | 2320203021323120130123 |
5 | 3130241001044313302 |
6 | 42550031330001523 |
7 | 2446153014640632 |
oct | 270431173303433 |
9 | 48811715320506 |
10 | 12682131244827 |
11 | 404a509513240 |
12 | 1509a701162a3 |
13 | 70cbc5b8c4c5 |
14 | 31bb65a9c519 |
15 | 16ed583e6ebc |
hex | b88c9ed871b |
12682131244827 has 16 divisors (see below), whose sum is σ = 19417617217920. Its totient is φ = 7281606456000.
The previous prime is 12682131244771. The next prime is 12682131244847. The reversal of 12682131244827 is 72844213128621.
It is not a de Polignac number, because 12682131244827 - 215 = 12682131212059 is a prime.
It is a super-2 number, since 2×126821312448272 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12682131244827.
It is not an unprimeable number, because it can be changed into a prime (12682131244847) 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 15 ways as a sum of consecutive naturals, for example, 10113341674 + ... + 10113342927.
It is an arithmetic number, because the mean of its divisors is an integer number (1213601076120).
Almost surely, 212682131244827 is an apocalyptic number.
12682131244827 is a deficient number, since it is larger than the sum of its proper divisors (6735485973093).
12682131244827 is a wasteful number, since it uses less digits than its factorization.
12682131244827 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20226684634.
The product of its digits is 2064384, while the sum is 51.
The spelling of 12682131244827 in words is "twelve trillion, six hundred eighty-two billion, one hundred thirty-one million, two hundred forty-four thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •