Base | Representation |
---|---|
bin | 11100001100101000011110… |
… | …111001101011011011110101 |
3 | 121021002120021100201122222102 |
4 | 130030220132321223123311 |
5 | 112223313422430010201 |
6 | 1115430545452111445 |
7 | 35056446522415403 |
oct | 3414503671533365 |
9 | 537076240648872 |
10 | 124013404141301 |
11 | 36572875684604 |
12 | 11aaa766165585 |
13 | 542754c25865c |
14 | 228a3d069a473 |
15 | e50d1729326b |
hex | 70ca1ee6b6f5 |
124013404141301 has 8 divisors (see below), whose sum is σ = 124164226948800. Its totient is φ = 123862596343200.
The previous prime is 124013404141283. The next prime is 124013404141313. The reversal of 124013404141301 is 103141404310421.
It is a happy number.
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 124013404141301 - 234 = 123996224272117 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 (124013404141351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12826976 + ... + 20311526.
It is an arithmetic number, because the mean of its divisors is an integer number (15520528368600).
Almost surely, 2124013404141301 is an apocalyptic number.
It is an amenable number.
124013404141301 is a deficient number, since it is larger than the sum of its proper divisors (150822807499).
124013404141301 is an equidigital number, since it uses as much as digits as its factorization.
124013404141301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7504699.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 124013404141301 its reverse (103141404310421), we get a palindrome (227154808451722).
The spelling of 124013404141301 in words is "one hundred twenty-four trillion, thirteen billion, four hundred four million, one hundred forty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •