Base | Representation |
---|---|
bin | 11100001100011101000111… |
… | …100000100111011010101100 |
3 | 121021001101202212111020120201 |
4 | 130030131013200213122230 |
5 | 112223113424314111322 |
6 | 1115421210510323244 |
7 | 35055535226445040 |
oct | 3414350740473254 |
9 | 537041685436521 |
10 | 124001200535212 |
11 | 36568682aa7740 |
12 | 11aa831b1b9524 |
13 | 5426355b76370 |
14 | 22899939dc020 |
15 | e50850c04d27 |
hex | 70c7478276ac |
124001200535212 has 48 divisors (see below), whose sum is σ = 291359464204032. Its totient is φ = 44595836354880.
The previous prime is 124001200535189. The next prime is 124001200535239. The reversal of 124001200535212 is 212535002100421.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
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, 15484661398 + ... + 15484669405.
It is an arithmetic number, because the mean of its divisors is an integer number (6069988837584).
Almost surely, 2124001200535212 is an apocalyptic number.
It is an amenable number.
124001200535212 is an abundant number, since it is smaller than the sum of its proper divisors (167358263668820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124001200535212 is a wasteful number, since it uses less digits than its factorization.
124001200535212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30969330838 (or 30969330836 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 124001200535212 its reverse (212535002100421), we get a palindrome (336536202635633).
The spelling of 124001200535212 in words is "one hundred twenty-four trillion, one billion, two hundred million, five hundred thirty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •