Base | Representation |
---|---|
bin | 10110100111111011… |
… | …10001010101100001 |
3 | 1011100111001211100112 |
4 | 23103331301111201 |
5 | 144333401320113 |
6 | 5325125301105 |
7 | 606664213445 |
oct | 132375612541 |
9 | 34314054315 |
10 | 12146120033 |
11 | 5173193833 |
12 | 242b864795 |
13 | 11b7505698 |
14 | 8331b6825 |
15 | 4b14d55a8 |
hex | 2d3f71561 |
12146120033 has 8 divisors (see below), whose sum is σ = 12905103240. Its totient is φ = 11431637760.
The previous prime is 12146120029. The next prime is 12146120047. The reversal of 12146120033 is 33002164121.
It can be written as a sum of positive squares in 4 ways, for example, as 2270331904 + 9875788129 = 47648^2 + 99377^2 .
It is not a de Polignac number, because 12146120033 - 22 = 12146120029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12146119990 and 12146120008.
It is not an unprimeable number, because it can be changed into a prime (12146120003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1231208 + ... + 1241033.
It is an arithmetic number, because the mean of its divisors is an integer number (1613137905).
Almost surely, 212146120033 is an apocalyptic number.
It is an amenable number.
12146120033 is a deficient number, since it is larger than the sum of its proper divisors (758983207).
12146120033 is an frugal number, since it uses more digits than its factorization.
12146120033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2472292 (or 2472258 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12146120033 its reverse (33002164121), we get a palindrome (45148284154).
The spelling of 12146120033 in words is "twelve billion, one hundred forty-six million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •