Base | Representation |
---|---|
bin | 10101001010010… |
… | …000011001100001 |
3 | 220202000101100220 |
4 | 111022100121201 |
5 | 1211340311040 |
6 | 55121033253 |
7 | 11540352000 |
oct | 2512203141 |
9 | 822011326 |
10 | 355010145 |
11 | 172437416 |
12 | 9aa85829 |
13 | 5871b799 |
14 | 35212c37 |
15 | 212782d0 |
hex | 15290661 |
355010145 has 32 divisors (see below), whose sum is σ = 662419200. Its totient is φ = 162288000.
The previous prime is 355010143. The next prime is 355010177. The reversal of 355010145 is 541010553.
It is not a de Polignac number, because 355010145 - 21 = 355010143 is a prime.
It is not an unprimeable number, because it can be changed into a prime (355010143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29356 + ... + 39645.
It is an arithmetic number, because the mean of its divisors is an integer number (20700600).
Almost surely, 2355010145 is an apocalyptic number.
355010145 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
355010145 is a deficient number, since it is larger than the sum of its proper divisors (307409055).
355010145 is an equidigital number, since it uses as much as digits as its factorization.
355010145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69030 (or 69016 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 355010145 is about 18841.7128998401. The cubic root of 355010145 is about 708.0766199916.
Adding to 355010145 its reverse (541010553), we get a palindrome (896020698).
It can be divided in two parts, 3550 and 10145, that added together give a triangular number (13695 = T165).
The spelling of 355010145 in words is "three hundred fifty-five million, ten thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •