Base | Representation |
---|---|
bin | 10110011011010011… |
… | …10000111010100101 |
3 | 1011002002210011000201 |
4 | 23031221300322211 |
5 | 144124243242013 |
6 | 5310423310501 |
7 | 604240054165 |
oct | 131551607245 |
9 | 34062704021 |
10 | 12040212133 |
11 | 5119427644 |
12 | 24002ab431 |
13 | 119b5a3aa1 |
14 | 8230c85a5 |
15 | 4a70653dd |
hex | 2cda70ea5 |
12040212133 has 4 divisors (see below), whose sum is σ = 12041799628. Its totient is φ = 12038624640.
The previous prime is 12040212131. The next prime is 12040212139. The reversal of 12040212133 is 33121204021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5374795969 + 6665416164 = 73313^2 + 81642^2 .
It is a cyclic number.
It is not a de Polignac number, because 12040212133 - 21 = 12040212131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12040212133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12040212131) 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, 782316 + ... + 797557.
It is an arithmetic number, because the mean of its divisors is an integer number (3010449907).
Almost surely, 212040212133 is an apocalyptic number.
It is an amenable number.
12040212133 is a deficient number, since it is larger than the sum of its proper divisors (1587495).
12040212133 is an equidigital number, since it uses as much as digits as its factorization.
12040212133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1587494.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 12040212133 its reverse (33121204021), we get a palindrome (45161416154).
The spelling of 12040212133 in words is "twelve billion, forty million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •