Base | Representation |
---|---|
bin | 111001001010101111010001… |
… | …100100110010110110011000 |
3 | 1012222020011000111211200000021 |
4 | 321022233101210302312120 |
5 | 230423333142243433102 |
6 | 2250423442153520224 |
7 | 103646654461206541 |
oct | 7112572144626630 |
9 | 1188204014750007 |
10 | 251426606624152 |
11 | 73126474841203 |
12 | 242481b1a13074 |
13 | aa3a5729370bb |
14 | 461318131b4c8 |
15 | 1e102b2add137 |
hex | e4abd1932d98 |
251426606624152 has 64 divisors (see below), whose sum is σ = 525447158976000. Its totient is φ = 112086843572736.
The previous prime is 251426606624111. The next prime is 251426606624161.
251426606624152 is nontrivially palindromic in base 10.
251426606624152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 251426606624152.
It is a congruent number.
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, 66393349 + ... + 70078027.
It is an arithmetic number, because the mean of its divisors is an integer number (8210111859000).
Almost surely, 2251426606624152 is an apocalyptic number.
It is an amenable number.
251426606624152 is an abundant number, since it is smaller than the sum of its proper divisors (274020552351848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251426606624152 is a wasteful number, since it uses less digits than its factorization.
251426606624152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3711128 (or 3711124 counting only the distinct ones).
The product of its (nonzero) digits is 8294400, while the sum is 52.
The spelling of 251426606624152 in words is "two hundred fifty-one trillion, four hundred twenty-six billion, six hundred six million, six hundred twenty-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •