Base | Representation |
---|---|
bin | 10100110111101… |
… | …100001010010010 |
3 | 220101212010001210 |
4 | 110313230022102 |
5 | 1204114034442 |
6 | 54424440550 |
7 | 11451111300 |
oct | 2467541222 |
9 | 811763053 |
10 | 350143122 |
11 | 16a71278a |
12 | 99319156 |
13 | 577063a4 |
14 | 34707270 |
15 | 20b1619c |
hex | 14dec292 |
350143122 has 96 divisors (see below), whose sum is σ = 866961792. Its totient is φ = 93789696.
The previous prime is 350143121. The next prime is 350143133. The reversal of 350143122 is 221341053.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (350143121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 357898 + ... + 358874.
It is an arithmetic number, because the mean of its divisors is an integer number (9030852).
Almost surely, 2350143122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 350143122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (433480896).
350143122 is an abundant number, since it is smaller than the sum of its proper divisors (516818670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350143122 is a wasteful number, since it uses less digits than its factorization.
350143122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1072 (or 1065 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 350143122 is about 18712.1116392565. Note that the first 3 decimals coincide. The cubic root of 350143122 is about 704.8259194958.
Adding to 350143122 its reverse (221341053), we get a palindrome (571484175).
The spelling of 350143122 in words is "three hundred fifty million, one hundred forty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •