Base | Representation |
---|---|
bin | 111000111001011110100011… |
… | …010111011100111101101000 |
3 | 1012211000202021011012010110120 |
4 | 320321132203113130331220 |
5 | 230244414340110313000 |
6 | 2244114510114243240 |
7 | 103465162616524431 |
oct | 7071364327347550 |
9 | 1184022234163416 |
10 | 250240420401000 |
11 | 72809403620117 |
12 | 2409632a586520 |
13 | a9827551b8963 |
14 | 45b19b5672488 |
15 | 1dde4da9ed6a0 |
hex | e397a35dcf68 |
250240420401000 has 64 divisors (see below), whose sum is σ = 780750111660480. Its totient is φ = 66730778772800.
The previous prime is 250240420400977. The next prime is 250240420401011. The reversal of 250240420401000 is 104024042052.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41706733734 + ... + 41706739733.
It is an arithmetic number, because the mean of its divisors is an integer number (12199220494695).
Almost surely, 2250240420401000 is an apocalyptic number.
250240420401000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
250240420401000 is an abundant number, since it is smaller than the sum of its proper divisors (530509691259480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250240420401000 is a wasteful number, since it uses less digits than its factorization.
250240420401000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83413473491 (or 83413473477 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 24.
Adding to 250240420401000 its reverse (104024042052), we get a palindrome (250344444443052).
The spelling of 250240420401000 in words is "two hundred fifty trillion, two hundred forty billion, four hundred twenty million, four hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •