Base | Representation |
---|---|
bin | 10111000100000010… |
… | …10011011000101101 |
3 | 1011221220210001122022 |
4 | 23202001103120231 |
5 | 200324233130312 |
6 | 5404351355525 |
7 | 615556433261 |
oct | 134201233055 |
9 | 34856701568 |
10 | 12381926957 |
11 | 5284302a94 |
12 | 2496822ba5 |
13 | 1224318aca |
14 | 85663a0a1 |
15 | 4c7064172 |
hex | 2e205362d |
12381926957 has 4 divisors (see below), whose sum is σ = 12425991036. Its totient is φ = 12337862880.
The previous prime is 12381926941. The next prime is 12381926959. The reversal of 12381926957 is 75962918321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75962918321 = 6451 ⋅11775371.
It can be written as a sum of positive squares in 2 ways, for example, as 10934048356 + 1447878601 = 104566^2 + 38051^2 .
It is a cyclic number.
It is not a de Polignac number, because 12381926957 - 24 = 12381926941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12381926899 and 12381926908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12381926959) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22031618 + ... + 22032179.
It is an arithmetic number, because the mean of its divisors is an integer number (3106497759).
Almost surely, 212381926957 is an apocalyptic number.
It is an amenable number.
12381926957 is a deficient number, since it is larger than the sum of its proper divisors (44064079).
12381926957 is an equidigital number, since it uses as much as digits as its factorization.
12381926957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44064078.
The product of its digits is 1632960, while the sum is 53.
The spelling of 12381926957 in words is "twelve billion, three hundred eighty-one million, nine hundred twenty-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •