Base | Representation |
---|---|
bin | 111000110110011011000100… |
… | …100001001011111010001100 |
3 | 1012210021200111001120200222010 |
4 | 320312123010201023322030 |
5 | 230233000002420000322 |
6 | 2243434234153021220 |
7 | 103444052310011403 |
oct | 7066330441137214 |
9 | 1183250431520863 |
10 | 250030523203212 |
11 | 7273839307a814 |
12 | 240617103b4810 |
13 | a968a1459443b |
14 | 45a5782d4c63a |
15 | 1dd8d0372620c |
hex | e366c484be8c |
250030523203212 has 12 divisors (see below), whose sum is σ = 583404554140856. Its totient is φ = 83343507734400.
The previous prime is 250030523203189. The next prime is 250030523203229. The reversal of 250030523203212 is 212302325030052.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 250030523203212.
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 3 ways as a sum of consecutive naturals, for example, 10417938466789 + ... + 10417938466812.
Almost surely, 2250030523203212 is an apocalyptic number.
It is an amenable number.
250030523203212 is an abundant number, since it is smaller than the sum of its proper divisors (333374030937644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250030523203212 is a wasteful number, since it uses less digits than its factorization.
250030523203212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20835876933608 (or 20835876933606 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 250030523203212 its reverse (212302325030052), we get a palindrome (462332848233264).
The spelling of 250030523203212 in words is "two hundred fifty trillion, thirty billion, five hundred twenty-three million, two hundred three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •