Base | Representation |
---|---|
bin | 10110100110100001… |
… | …10011011010010101 |
3 | 1011022122212221021200 |
4 | 23103100303122111 |
5 | 144322342111203 |
6 | 5324024503113 |
7 | 606462056244 |
oct | 132320633225 |
9 | 34278787250 |
10 | 12134332053 |
11 | 51675722a8 |
12 | 242791aa99 |
13 | 11b4c3904c |
14 | 8317c895b |
15 | 4b04579a3 |
hex | 2d3433695 |
12134332053 has 12 divisors (see below), whose sum is σ = 17528415840. Its totient is φ = 8089071336.
The previous prime is 12134332051. The next prime is 12134332069. The reversal of 12134332053 is 35023343121.
12134332053 is a `hidden beast` number, since 1 + 21 + 3 + 433 + 205 + 3 = 666.
12134332053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12134332053 - 21 = 12134332051 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12134332051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 185050 + ... + 241892.
It is an arithmetic number, because the mean of its divisors is an integer number (1460701320).
Almost surely, 212134332053 is an apocalyptic number.
It is an amenable number.
12134332053 is a deficient number, since it is larger than the sum of its proper divisors (5394083787).
12134332053 is a wasteful number, since it uses less digits than its factorization.
12134332053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80568 (or 80565 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 12134332053 its reverse (35023343121), we get a palindrome (47157675174).
The spelling of 12134332053 in words is "twelve billion, one hundred thirty-four million, three hundred thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •