Base | Representation |
---|---|
bin | 1011000100011101111110… |
… | …1101001111101010010100 |
3 | 1121002120111111000010022111 |
4 | 2301013133231033222110 |
5 | 3043404004223414424 |
6 | 41515243435040404 |
7 | 2364232345663261 |
oct | 261073755175224 |
9 | 47076444003274 |
10 | 12171395529364 |
11 | 3972950517925 |
12 | 1446a938a0104 |
13 | 6a39b07bb596 |
14 | 301154b22268 |
15 | 16191502b194 |
hex | b11dfb4fa94 |
12171395529364 has 12 divisors (see below), whose sum is σ = 22034422941300. Its totient is φ = 5875846117568.
The previous prime is 12171395529331. The next prime is 12171395529367. The reversal of 12171395529364 is 46392559317121.
It can be written as a sum of positive squares in 2 ways, for example, as 6837743848464 + 5333651680900 = 2614908^2 + 2309470^2 .
It is a Harshad number since it is a multiple of its sum of digits (58).
It is a junction number, because it is equal to n+sod(n) for n = 12171395529299 and 12171395529308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12171395529367) 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, 52462911649 + ... + 52462911880.
It is an arithmetic number, because the mean of its divisors is an integer number (1836201911775).
Almost surely, 212171395529364 is an apocalyptic number.
It is an amenable number.
12171395529364 is a deficient number, since it is larger than the sum of its proper divisors (9863027411936).
12171395529364 is a wasteful number, since it uses less digits than its factorization.
12171395529364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104925823562 (or 104925823560 counting only the distinct ones).
The product of its digits is 12247200, while the sum is 58.
The spelling of 12171395529364 in words is "twelve trillion, one hundred seventy-one billion, three hundred ninety-five million, five hundred twenty-nine thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •