Base | Representation |
---|---|
bin | 11100001100011110000110… |
… | …001000001100111101101101 |
3 | 121021001111111002022110120011 |
4 | 130030132012020030331231 |
5 | 112223123102240200023 |
6 | 1115421503035453221 |
7 | 35055603244215136 |
oct | 3414360610147555 |
9 | 537044432273504 |
10 | 124002251100013 |
11 | 36569072017610 |
12 | 11aa8572bb7211 |
13 | 5426492708a40 |
14 | 2289a5334cc8d |
15 | e508b307350d |
hex | 70c78620cf6d |
124002251100013 has 16 divisors (see below), whose sum is σ = 145902030120000. Its totient is φ = 103899930382080.
The previous prime is 124002251100011. The next prime is 124002251100017. The reversal of 124002251100013 is 310001152200421.
It is a cyclic number.
It is not a de Polignac number, because 124002251100013 - 21 = 124002251100011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124002251100011) 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, 657833388 + ... + 658021861.
It is an arithmetic number, because the mean of its divisors is an integer number (9118876882500).
Almost surely, 2124002251100013 is an apocalyptic number.
124002251100013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
124002251100013 is a deficient number, since it is larger than the sum of its proper divisors (21899779019987).
124002251100013 is a wasteful number, since it uses less digits than its factorization.
124002251100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1315855932.
The product of its (nonzero) digits is 480, while the sum is 22.
The spelling of 124002251100013 in words is "one hundred twenty-four trillion, two billion, two hundred fifty-one million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •