Base | Representation |
---|---|
bin | 10110100101010011… |
… | …10010011100111001 |
3 | 1011021221122022201121 |
4 | 23102221302130321 |
5 | 144312232321010 |
6 | 5323021345241 |
7 | 606306121312 |
oct | 132251623471 |
9 | 34257568647 |
10 | 12124104505 |
11 | 5161817187 |
12 | 2424408221 |
13 | 11b2a97a46 |
14 | 8302c5609 |
15 | 4ae5d73da |
hex | 2d2a72739 |
12124104505 has 8 divisors (see below), whose sum is σ = 14549523912. Its totient is φ = 9698884608.
The previous prime is 12124104457. The next prime is 12124104511. The reversal of 12124104505 is 50540142121.
It can be written as a sum of positive squares in 4 ways, for example, as 2509909801 + 9614194704 = 50099^2 + 98052^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12124104505 - 233 = 3534169913 is a prime.
It is a super-2 number, since 2×121241045052 (a number of 21 digits) contains 22 as substring.
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 12124104505.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 180889 + ... + 238681.
It is an arithmetic number, because the mean of its divisors is an integer number (1818690489).
Almost surely, 212124104505 is an apocalyptic number.
It is an amenable number.
12124104505 is a deficient number, since it is larger than the sum of its proper divisors (2425419407).
12124104505 is an equidigital number, since it uses as much as digits as its factorization.
12124104505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99755.
The product of its (nonzero) digits is 1600, while the sum is 25.
Adding to 12124104505 its reverse (50540142121), we get a palindrome (62664246626).
The spelling of 12124104505 in words is "twelve billion, one hundred twenty-four million, one hundred four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •