Base | Representation |
---|---|
bin | 1010001011111110000… |
… | …01110111010101110110 |
3 | 1020110110202001110201120 |
4 | 11011333001313111312 |
5 | 21213322011434410 |
6 | 424444255204410 |
7 | 34200624024111 |
oct | 5057701672566 |
9 | 1213422043646 |
10 | 350023546230 |
11 | 125498191a46 |
12 | 57a06216706 |
13 | 27012723bc7 |
14 | 12d26a41578 |
15 | 9189155570 |
hex | 517f077576 |
350023546230 has 32 divisors (see below), whose sum is σ = 845619810048. Its totient is φ = 92721468000.
The previous prime is 350023546217. The next prime is 350023546237. The reversal of 350023546230 is 32645320053.
It is a junction number, because it is equal to n+sod(n) for n = 350023546191 and 350023546200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (350023546237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38629416 + ... + 38638475.
It is an arithmetic number, because the mean of its divisors is an integer number (26425619064).
Almost surely, 2350023546230 is an apocalyptic number.
350023546230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
350023546230 is an abundant number, since it is smaller than the sum of its proper divisors (495596263818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350023546230 is a wasteful number, since it uses less digits than its factorization.
350023546230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77268052.
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 350023546230 its reverse (32645320053), we get a palindrome (382668866283).
The spelling of 350023546230 in words is "three hundred fifty billion, twenty-three million, five hundred forty-six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •