Base | Representation |
---|---|
bin | 1111000001101001110… |
… | …0100100010111010000 |
3 | 220200022100012211000000 |
4 | 3300122130210113100 |
5 | 13212133240444402 |
6 | 314331053130000 |
7 | 24435664352415 |
oct | 3603234442720 |
9 | 820270184000 |
10 | 258141734352 |
11 | 9a528308827 |
12 | 42043189900 |
13 | 1b45ba98898 |
14 | c6cbc5210c |
15 | 6aac9aec1c |
hex | 3c1a7245d0 |
258141734352 has 70 divisors (see below), whose sum is σ = 749881411202. Its totient is φ = 86047240896.
The previous prime is 258141734329. The next prime is 258141734359. The reversal of 258141734352 is 253437141852.
258141734352 is a `hidden beast` number, since 2 + 5 + 8 + 141 + 73 + 435 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 202046654016 + 56095080336 = 449496^2 + 236844^2 .
It is a junction number, because it is equal to n+sod(n) for n = 258141734298 and 258141734307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (258141734359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 11054083 + ... + 11077410.
Almost surely, 2258141734352 is an apocalyptic number.
It is an amenable number.
258141734352 is an abundant number, since it is smaller than the sum of its proper divisors (491739676850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258141734352 is an equidigital number, since it uses as much as digits as its factorization.
258141734352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22131519 (or 22131498 counting only the distinct ones).
The product of its digits is 806400, while the sum is 45.
The spelling of 258141734352 in words is "two hundred fifty-eight billion, one hundred forty-one million, seven hundred thirty-four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •