Base | Representation |
---|---|
bin | 111001010101011000… |
… | …1111110010101110101 |
3 | 102202210202010002000222 |
4 | 1302222301332111311 |
5 | 4004124310431123 |
6 | 132321301144125 |
7 | 11616064244015 |
oct | 1625261762565 |
9 | 382722102028 |
10 | 123124311413 |
11 | 48242511574 |
12 | 1ba420bb045 |
13 | b7c257504c |
14 | 5d6026bc45 |
15 | 33094026c8 |
hex | 1caac7e575 |
123124311413 has 4 divisors (see below), whose sum is σ = 128477542368. Its totient is φ = 117771080460.
The previous prime is 123124311389. The next prime is 123124311463. The reversal of 123124311413 is 314113421321.
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, and also an emirpimes, since its reverse is a distinct semiprime: 314113421321 = 7 ⋅44873345903.
It is a cyclic number.
It is not a de Polignac number, because 123124311413 - 214 = 123124295029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123124311463) 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, 2676615443 + ... + 2676615488.
It is an arithmetic number, because the mean of its divisors is an integer number (32119385592).
Almost surely, 2123124311413 is an apocalyptic number.
It is an amenable number.
123124311413 is a deficient number, since it is larger than the sum of its proper divisors (5353230955).
123124311413 is an equidigital number, since it uses as much as digits as its factorization.
123124311413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5353230954.
The product of its digits is 1728, while the sum is 26.
Adding to 123124311413 its reverse (314113421321), we get a palindrome (437237732734).
The spelling of 123124311413 in words is "one hundred twenty-three billion, one hundred twenty-four million, three hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •