Base | Representation |
---|---|
bin | 10101001010011… |
… | …111000000110001 |
3 | 220202010102110210 |
4 | 111022133000301 |
5 | 1211344220001 |
6 | 55122214333 |
7 | 11541021336 |
oct | 2512370061 |
9 | 822112423 |
10 | 355070001 |
11 | 172478390 |
12 | 9aab43a9 |
13 | 5873cac0 |
14 | 3522a98d |
15 | 2128add6 |
hex | 1529f031 |
355070001 has 32 divisors (see below), whose sum is σ = 574156800. Its totient is φ = 192225600.
The previous prime is 355069993. The next prime is 355070071. The reversal of 355070001 is 100070553.
It is a happy number.
It is not a de Polignac number, because 355070001 - 23 = 355069993 is a prime.
It is a super-2 number, since 2×3550700012 = 252149411220280002, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 355070001.
It is not an unprimeable number, because it can be changed into a prime (355070071) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 51 + ... + 26648.
It is an arithmetic number, because the mean of its divisors is an integer number (17942400).
Almost surely, 2355070001 is an apocalyptic number.
355070001 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
355070001 is a deficient number, since it is larger than the sum of its proper divisors (219086799).
355070001 is a wasteful number, since it uses less digits than its factorization.
355070001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26757.
The product of its (nonzero) digits is 525, while the sum is 21.
The square root of 355070001 is about 18843.3012235118. The cubic root of 355070001 is about 708.1164125186.
The spelling of 355070001 in words is "three hundred fifty-five million, seventy thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •