Base | Representation |
---|---|
bin | 111001101111100001… |
… | …1011101110110010011 |
3 | 102212001212100022212122 |
4 | 1303133003131312103 |
5 | 4012423313442042 |
6 | 132544310244455 |
7 | 11646603522326 |
oct | 1633703356623 |
9 | 385055308778 |
10 | 124001312147 |
11 | 48652565169 |
12 | 2004795672b |
13 | b9021780ab |
14 | 600491c7bd |
15 | 335b3d97d2 |
hex | 1cdf0ddd93 |
124001312147 has 4 divisors (see below), whose sum is σ = 126340959600. Its totient is φ = 121661664696.
The previous prime is 124001312117. The next prime is 124001312167. The reversal of 124001312147 is 741213100421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 741213100421 = 17 ⋅43600770613.
It is a cyclic number.
It is not a de Polignac number, because 124001312147 - 214 = 124001295763 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124001312117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1169823647 + ... + 1169823752.
It is an arithmetic number, because the mean of its divisors is an integer number (31585239900).
Almost surely, 2124001312147 is an apocalyptic number.
124001312147 is a deficient number, since it is larger than the sum of its proper divisors (2339647453).
124001312147 is an equidigital number, since it uses as much as digits as its factorization.
124001312147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2339647452.
The product of its (nonzero) digits is 1344, while the sum is 26.
Adding to 124001312147 its reverse (741213100421), we get a palindrome (865214412568).
The spelling of 124001312147 in words is "one hundred twenty-four billion, one million, three hundred twelve thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •