Base | Representation |
---|---|
bin | 1011110001001100110111… |
… | …1110000110111110111111 |
3 | 1200211001010200022011222222 |
4 | 2330103031332012332333 |
5 | 3144001402124400432 |
6 | 43304301234555555 |
7 | 2503606466420300 |
oct | 274231576067677 |
9 | 50731120264888 |
10 | 12939897106367 |
11 | 4139863635180 |
12 | 154ba09438bbb |
13 | 72b2c4b1362a |
14 | 32a419a2a7a7 |
15 | 1768e2dac112 |
hex | bc4cdf86fbf |
12939897106367 has 24 divisors (see below), whose sum is σ = 16422095608272. Its totient is φ = 10082330496000.
The previous prime is 12939897106327. The next prime is 12939897106379. The reversal of 12939897106367 is 76360179893921.
It is not a de Polignac number, because 12939897106367 - 220 = 12939896057791 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12939897106367.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12939897106327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6928613 + ... + 8595665.
It is an arithmetic number, because the mean of its divisors is an integer number (684253983678).
Almost surely, 212939897106367 is an apocalyptic number.
12939897106367 is a deficient number, since it is larger than the sum of its proper divisors (3482198501905).
12939897106367 is a wasteful number, since it uses less digits than its factorization.
12939897106367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1681479 (or 1681472 counting only the distinct ones).
The product of its (nonzero) digits is 185177664, while the sum is 71.
The spelling of 12939897106367 in words is "twelve trillion, nine hundred thirty-nine billion, eight hundred ninety-seven million, one hundred six thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •