Base | Representation |
---|---|
bin | 1011000011111011100011… |
… | …1101111110111010000011 |
3 | 1121001200122112120200201101 |
4 | 2300332320331332322003 |
5 | 3043231043322434141 |
6 | 41511114524515231 |
7 | 2363454361330222 |
oct | 260767075767203 |
9 | 47050575520641 |
10 | 12162155671171 |
11 | 3969a3989a690 |
12 | 14451353abb17 |
13 | 6a2b6a439b7c |
14 | 300919910cb9 |
15 | 161573c70531 |
hex | b0fb8f7ee83 |
12162155671171 has 4 divisors (see below), whose sum is σ = 13267806186744. Its totient is φ = 11056505155600.
The previous prime is 12162155671157. The next prime is 12162155671181. The reversal of 12162155671171 is 17117655126121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12162155671171 - 211 = 12162155669123 is a prime.
It is a super-2 number, since 2×121621556711712 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12162155671121) 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, 552825257770 + ... + 552825257791.
It is an arithmetic number, because the mean of its divisors is an integer number (3316951546686).
Almost surely, 212162155671171 is an apocalyptic number.
12162155671171 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12162155671171 is a deficient number, since it is larger than the sum of its proper divisors (1105650515573).
12162155671171 is a wasteful number, since it uses less digits than its factorization.
12162155671171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1105650515572.
The product of its digits is 176400, while the sum is 46.
The spelling of 12162155671171 in words is "twelve trillion, one hundred sixty-two billion, one hundred fifty-five million, six hundred seventy-one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •