Base | Representation |
---|---|
bin | 1010001011111110000… |
… | …01011100001101101000 |
3 | 1020110110201211211022002 |
4 | 11011333001130031220 |
5 | 21213321444410422 |
6 | 424444252550132 |
7 | 34200623052131 |
oct | 5057701341550 |
9 | 1213421754262 |
10 | 350023435112 |
11 | 12549811650a |
12 | 57a06182348 |
13 | 270126b5460 |
14 | 12d26a12c88 |
15 | 9189132692 |
hex | 517f05c368 |
350023435112 has 64 divisors (see below), whose sum is σ = 729771033600. Its totient is φ = 156296517120.
The previous prime is 350023435087. The next prime is 350023435147. The reversal of 350023435112 is 211534320053.
It is a happy number.
It is an unprimeable number.
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, 14357189 + ... + 14381547.
It is an arithmetic number, because the mean of its divisors is an integer number (11402672400).
Almost surely, 2350023435112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 350023435112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (364885516800).
350023435112 is an abundant number, since it is smaller than the sum of its proper divisors (379747598488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350023435112 is a wasteful number, since it uses less digits than its factorization.
350023435112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28866 (or 28862 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 350023435112 its reverse (211534320053), we get a palindrome (561557755165).
The spelling of 350023435112 in words is "three hundred fifty billion, twenty-three million, four hundred thirty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.553 sec. • engine limits •