Base | Representation |
---|---|
bin | 111001000100101110001000… |
… | …010010110011010010001000 |
3 | 1012220202121120202111020122010 |
4 | 321010232020102303102020 |
5 | 230400044221414411102 |
6 | 2245505450305055520 |
7 | 103605044430430650 |
oct | 7104561022632210 |
9 | 1186677522436563 |
10 | 251013060310152 |
11 | 72a8704a714688 |
12 | 241a001a0275a0 |
13 | aa0a5789a755a |
14 | 45db15001d360 |
15 | 1e0465bd2bd6c |
hex | e44b884b3488 |
251013060310152 has 128 divisors (see below), whose sum is σ = 718865049692160. Its totient is φ = 71549542702080.
The previous prime is 251013060310139. The next prime is 251013060310163.
251013060310152 is nontrivially palindromic in base 10.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2414394123 + ... + 2414498085.
It is an arithmetic number, because the mean of its divisors is an integer number (5616133200720).
Almost surely, 2251013060310152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 251013060310152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (359432524846080).
251013060310152 is an abundant number, since it is smaller than the sum of its proper divisors (467851989382008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251013060310152 is a wasteful number, since it uses less digits than its factorization.
251013060310152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137603 (or 137599 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 251013060310152 in words is "two hundred fifty-one trillion, thirteen billion, sixty million, three hundred ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •