Base | Representation |
---|---|
bin | 111001111110011011… |
… | …0011101101100000111 |
3 | 102220100201000021200010 |
4 | 1303330312131230013 |
5 | 4014434303020403 |
6 | 133110045121303 |
7 | 11665153624041 |
oct | 1637466355407 |
9 | 386321007603 |
10 | 124501220103 |
11 | 48889769437 |
12 | 20167259233 |
13 | b9818ca310 |
14 | 605108ca91 |
15 | 338a235603 |
hex | 1cfcd9db07 |
124501220103 has 16 divisors (see below), whose sum is σ = 178864834176. Its totient is φ = 76575913440.
The previous prime is 124501220099. The next prime is 124501220131. The reversal of 124501220103 is 301022105421.
It is not a de Polignac number, because 124501220103 - 22 = 124501220099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 124501220103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124501220203) 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 15 ways as a sum of consecutive naturals, for example, 762633 + ... + 911378.
It is an arithmetic number, because the mean of its divisors is an integer number (11179052136).
Almost surely, 2124501220103 is an apocalyptic number.
124501220103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
124501220103 is a deficient number, since it is larger than the sum of its proper divisors (54363614073).
124501220103 is a wasteful number, since it uses less digits than its factorization.
124501220103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1675934.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 124501220103 its reverse (301022105421), we get a palindrome (425523325524).
The spelling of 124501220103 in words is "one hundred twenty-four billion, five hundred one million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •