Base | Representation |
---|---|
bin | 1011000000101011111110… |
… | …1010100111011110100101 |
3 | 1120212100211011102002020101 |
4 | 2300022333222213132211 |
5 | 3041322433431211013 |
6 | 41425341352304101 |
7 | 2356442464340365 |
oct | 260127752473645 |
9 | 46770734362211 |
10 | 12106433460133 |
11 | 394834508a801 |
12 | 14363840a2031 |
13 | 69a82a02356c |
14 | 2dbd512429a5 |
15 | 15edb1d658dd |
hex | b02bfaa77a5 |
12106433460133 has 2 divisors, whose sum is σ = 12106433460134. Its totient is φ = 12106433460132.
The previous prime is 12106433460119. The next prime is 12106433460167. The reversal of 12106433460133 is 33106433460121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6602520394369 + 5503913065764 = 2569537^2 + 2346042^2 .
It is a cyclic number.
It is not a de Polignac number, because 12106433460133 - 25 = 12106433460101 is a prime.
It is a super-2 number, since 2×121064334601332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12106433460092 and 12106433460101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12106433470133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6053216730066 + 6053216730067.
It is an arithmetic number, because the mean of its divisors is an integer number (6053216730067).
Almost surely, 212106433460133 is an apocalyptic number.
It is an amenable number.
12106433460133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12106433460133 is an equidigital number, since it uses as much as digits as its factorization.
12106433460133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 37.
The spelling of 12106433460133 in words is "twelve trillion, one hundred six billion, four hundred thirty-three million, four hundred sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •