Base | Representation |
---|---|
bin | 10100111010101… |
… | …111110111100101 |
3 | 220110100211200101 |
4 | 110322233313211 |
5 | 1204320212431 |
6 | 54453544101 |
7 | 11460660340 |
oct | 2472576745 |
9 | 813324611 |
10 | 350944741 |
11 | 17010aa84 |
12 | 99645031 |
13 | 57927214 |
14 | 34875457 |
15 | 20c23961 |
hex | 14eafde5 |
350944741 has 16 divisors (see below), whose sum is σ = 429836544. Its totient is φ = 279949824.
The previous prime is 350944721. The next prime is 350944751. The reversal of 350944741 is 147449053.
It is not a de Polignac number, because 350944741 - 25 = 350944709 is a prime.
It is a super-2 number, since 2×3509447412 = 246324422471114162, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 350944741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (350944721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23500 + ... + 35413.
It is an arithmetic number, because the mean of its divisors is an integer number (26864784).
Almost surely, 2350944741 is an apocalyptic number.
It is an amenable number.
350944741 is a deficient number, since it is larger than the sum of its proper divisors (78891803).
350944741 is a wasteful number, since it uses less digits than its factorization.
350944741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58980.
The product of its (nonzero) digits is 60480, while the sum is 37.
The square root of 350944741 is about 18733.5191835384. The cubic root of 350944741 is about 705.3633865947.
The spelling of 350944741 in words is "three hundred fifty million, nine hundred forty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •