Base | Representation |
---|---|
bin | 10110100011110000… |
… | …01110000001011001 |
3 | 1011021001012010221021 |
4 | 23101320032001121 |
5 | 144300421011413 |
6 | 5321435042441 |
7 | 606060511165 |
oct | 132170160131 |
9 | 34231163837 |
10 | 12111110233 |
11 | 5155451412 |
12 | 241bba0421 |
13 | 11b0198321 |
14 | 82c6a1ca5 |
15 | 4ad3bc18d |
hex | 2d1e0e059 |
12111110233 has 4 divisors (see below), whose sum is σ = 12823528500. Its totient is φ = 11398691968.
The previous prime is 12111110203. The next prime is 12111110237. The reversal of 12111110233 is 33201111121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33201111121 = 83 ⋅400013387.
It can be written as a sum of positive squares in 2 ways, for example, as 6586458649 + 5524651584 = 81157^2 + 74328^2 .
It is a cyclic number.
It is not a de Polignac number, because 12111110233 - 25 = 12111110201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12111110237) 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, 356209108 + ... + 356209141.
It is an arithmetic number, because the mean of its divisors is an integer number (3205882125).
Almost surely, 212111110233 is an apocalyptic number.
It is an amenable number.
12111110233 is a deficient number, since it is larger than the sum of its proper divisors (712418267).
12111110233 is an equidigital number, since it uses as much as digits as its factorization.
12111110233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712418266.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12111110233 its reverse (33201111121), we get a palindrome (45312221354).
The spelling of 12111110233 in words is "twelve billion, one hundred eleven million, one hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •