Base | Representation |
---|---|
bin | 10110101000110010… |
… | …11010010011101101 |
3 | 1011100222200221121002 |
4 | 23110121122103231 |
5 | 144342230200431 |
6 | 5325544450045 |
7 | 610112622116 |
oct | 132431322355 |
9 | 34328627532 |
10 | 12153365741 |
11 | 5177292620 |
12 | 2432179925 |
13 | 11b8b7169a |
14 | 83414120d |
15 | 4b1e673cb |
hex | 2d465a4ed |
12153365741 has 4 divisors (see below), whose sum is σ = 13258217184. Its totient is φ = 11048514300.
The previous prime is 12153365689. The next prime is 12153365753. The reversal of 12153365741 is 14756335121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12153365741 - 214 = 12153349357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12153365695 and 12153365704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12153365771) 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, 552425705 + ... + 552425726.
It is an arithmetic number, because the mean of its divisors is an integer number (3314554296).
Almost surely, 212153365741 is an apocalyptic number.
12153365741 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12153365741 is a deficient number, since it is larger than the sum of its proper divisors (1104851443).
12153365741 is a wasteful number, since it uses less digits than its factorization.
12153365741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1104851442.
The product of its digits is 75600, while the sum is 38.
The spelling of 12153365741 in words is "twelve billion, one hundred fifty-three million, three hundred sixty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •