Base | Representation |
---|---|
bin | 111001111000000100010101… |
… | …111001001111100110101110 |
3 | 1020101020221101001012021100020 |
4 | 321320010111321033212232 |
5 | 231330402201124000402 |
6 | 2301210444300543010 |
7 | 104421011145123000 |
oct | 7170042571174656 |
9 | 1211227331167306 |
10 | 254541604125102 |
11 | 74117540708468 |
12 | 2466ba50251a66 |
13 | ac0522a129148 |
14 | 46bdc45008370 |
15 | 1e6632803a8bc |
hex | e78115e4f9ae |
254541604125102 has 128 divisors (see below), whose sum is σ = 597285074534400. Its totient is φ = 72284992385760.
The previous prime is 254541604125019. The next prime is 254541604125167. The reversal of 254541604125102 is 201521406145452.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6416941473 + ... + 6416981139.
It is an arithmetic number, because the mean of its divisors is an integer number (4666289644800).
Almost surely, 2254541604125102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 254541604125102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (298642537267200).
254541604125102 is an abundant number, since it is smaller than the sum of its proper divisors (342743470409298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
254541604125102 is a wasteful number, since it uses less digits than its factorization.
254541604125102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58531 (or 58517 counting only the distinct ones).
The product of its (nonzero) digits is 384000, while the sum is 42.
The spelling of 254541604125102 in words is "two hundred fifty-four trillion, five hundred forty-one billion, six hundred four million, one hundred twenty-five thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •