Base | Representation |
---|---|
bin | 1111000011000100001… |
… | …0111001100000000000 |
3 | 220201021202122110122002 |
4 | 3300301002321200000 |
5 | 13213422321144102 |
6 | 314432435403132 |
7 | 24451250142602 |
oct | 3606102714000 |
9 | 821252573562 |
10 | 258520881152 |
11 | 9a702330396 |
12 | 4212a1534a8 |
13 | 1b4bc4b85c1 |
14 | c726349172 |
15 | 6ad0e04902 |
hex | 3c310b9800 |
258520881152 has 96 divisors (see below), whose sum is σ = 556299394560. Its totient is φ = 119661527040.
The previous prime is 258520881139. The next prime is 258520881221. The reversal of 258520881152 is 251188025852.
It is a junction number, because it is equal to n+sod(n) for n = 258520881097 and 258520881106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2062913 + ... + 2184639.
It is an arithmetic number, because the mean of its divisors is an integer number (5794785360).
Almost surely, 2258520881152 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 258520881152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (278149697280).
258520881152 is an abundant number, since it is smaller than the sum of its proper divisors (297778513408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258520881152 is a wasteful number, since it uses less digits than its factorization.
258520881152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121827 (or 121807 counting only the distinct ones).
The product of its (nonzero) digits is 512000, while the sum is 47.
The spelling of 258520881152 in words is "two hundred fifty-eight billion, five hundred twenty million, eight hundred eighty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •