Base | Representation |
---|---|
bin | 111001110101110100… |
… | …0000111001000110011 |
3 | 102212121120020211102010 |
4 | 1303223220013020303 |
5 | 4013341313320133 |
6 | 133021243254003 |
7 | 11655044443125 |
oct | 1635350071063 |
9 | 385546224363 |
10 | 124212245043 |
11 | 48750635177 |
12 | 200a651a303 |
13 | b936a8c763 |
14 | 6024949215 |
15 | 336eba3263 |
hex | 1ceba07233 |
124212245043 has 4 divisors (see below), whose sum is σ = 165616326728. Its totient is φ = 82808163360.
The previous prime is 124212245041. The next prime is 124212245071. The reversal of 124212245043 is 340542212421.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 124212245043 - 21 = 124212245041 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 124212245043.
It is not an unprimeable number, because it can be changed into a prime (124212245041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20702040838 + ... + 20702040843.
It is an arithmetic number, because the mean of its divisors is an integer number (41404081682).
Almost surely, 2124212245043 is an apocalyptic number.
124212245043 is a deficient number, since it is larger than the sum of its proper divisors (41404081685).
124212245043 is an equidigital number, since it uses as much as digits as its factorization.
124212245043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41404081684.
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 124212245043 its reverse (340542212421), we get a palindrome (464754457464).
The spelling of 124212245043 in words is "one hundred twenty-four billion, two hundred twelve million, two hundred forty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •