Base | Representation |
---|---|
bin | 10110100100110010… |
… | …01101100100011101 |
3 | 1011021122110112222220 |
4 | 23102121031210131 |
5 | 144310124243013 |
6 | 5322344255553 |
7 | 606224152506 |
oct | 132231154435 |
9 | 34248415886 |
10 | 12119759133 |
11 | 515a319469 |
12 | 2422a715b9 |
13 | 11b1c05c11 |
14 | 82d8b3bad |
15 | 4ae029b23 |
hex | 2d264d91d |
12119759133 has 8 divisors (see below), whose sum is σ = 16160604096. Its totient is φ = 8079376800.
The previous prime is 12119759131. The next prime is 12119759147. The reversal of 12119759133 is 33195791121.
It is a happy number.
12119759133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12119759133 - 21 = 12119759131 is a prime.
It is a super-2 number, since 2×121197591332 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12119759131) 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 7 ways as a sum of consecutive naturals, for example, 49048 + ... + 163233.
It is an arithmetic number, because the mean of its divisors is an integer number (2020075512).
Almost surely, 212119759133 is an apocalyptic number.
It is an amenable number.
12119759133 is a deficient number, since it is larger than the sum of its proper divisors (4040844963).
12119759133 is a wasteful number, since it uses less digits than its factorization.
12119759133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231315.
The product of its digits is 51030, while the sum is 42.
The spelling of 12119759133 in words is "twelve billion, one hundred nineteen million, seven hundred fifty-nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •