Base | Representation |
---|---|
bin | 10100111011010… |
… | …101001011000110 |
3 | 220110122121021200 |
4 | 110323111023012 |
5 | 1204340110132 |
6 | 54501123330 |
7 | 11462164665 |
oct | 2473251306 |
9 | 813577250 |
10 | 351097542 |
11 | 170204864 |
12 | 996b9546 |
13 | 5797b933 |
14 | 348b4ddc |
15 | 20c53d7c |
hex | 14ed52c6 |
351097542 has 48 divisors (see below), whose sum is σ = 808604160. Its totient is φ = 109785456.
The previous prime is 351097531. The next prime is 351097543. The reversal of 351097542 is 245790153.
351097542 is a `hidden beast` number, since 3 + 5 + 109 + 7 + 542 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 351097497 and 351097506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (351097543) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30243 + ... + 40209.
It is an arithmetic number, because the mean of its divisors is an integer number (16845920).
Almost surely, 2351097542 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 351097542, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (404302080).
351097542 is an abundant number, since it is smaller than the sum of its proper divisors (457506618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
351097542 is a wasteful number, since it uses less digits than its factorization.
351097542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10097 (or 10094 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The square root of 351097542 is about 18737.5970177608. The cubic root of 351097542 is about 705.4657432523.
The spelling of 351097542 in words is "three hundred fifty-one million, ninety-seven thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •