Base | Representation |
---|---|
bin | 1110011011111101010… |
… | …0100011100111000000 |
3 | 212201012010222110202000 |
4 | 3212333110203213000 |
5 | 13030422340112424 |
6 | 305535025024000 |
7 | 23630145325152 |
oct | 3467724434700 |
9 | 781163873660 |
10 | 248022972864 |
11 | 96205558527 |
12 | 4009a485000 |
13 | 1a5085c9154 |
14 | c00c016ad2 |
15 | 66b94933c9 |
hex | 39bf5239c0 |
248022972864 has 224 divisors, whose sum is σ = 738688896000. Its totient is φ = 81595312128.
The previous prime is 248022972853. The next prime is 248022972907. The reversal of 248022972864 is 468279220842.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 248022972864.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 110575327 + ... + 110577569.
Almost surely, 2248022972864 is an apocalyptic number.
248022972864 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 248022972864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (369344448000).
248022972864 is an abundant number, since it is smaller than the sum of its proper divisors (490665923136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
248022972864 is a wasteful number, since it uses less digits than its factorization.
248022972864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3072 (or 3056 counting only the distinct ones).
The product of its (nonzero) digits is 6193152, while the sum is 54.
The spelling of 248022972864 in words is "two hundred forty-eight billion, twenty-two million, nine hundred seventy-two thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •