Base | Representation |
---|---|
bin | 1101101101010010001… |
… | …1101011100001000101 |
3 | 211111212000011211211111 |
4 | 3123110203223201011 |
5 | 12324243023411221 |
6 | 300103513205021 |
7 | 23004525002365 |
oct | 3332443534105 |
9 | 744760154744 |
10 | 235494357061 |
11 | 90966474a97 |
12 | 39782700771 |
13 | 1928caa0612 |
14 | b5801149a5 |
15 | 61d4605be1 |
hex | 36d48eb845 |
235494357061 has 16 divisors (see below), whose sum is σ = 243065539584. Its totient is φ = 227987720064.
The previous prime is 235494357037. The next prime is 235494357083. The reversal of 235494357061 is 160753494532.
235494357061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-235494357061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 235494356996 and 235494357014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (235494357031) 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, 19738680 + ... + 19750606.
It is an arithmetic number, because the mean of its divisors is an integer number (15191596224).
Almost surely, 2235494357061 is an apocalyptic number.
It is an amenable number.
235494357061 is a deficient number, since it is larger than the sum of its proper divisors (7571182523).
235494357061 is a wasteful number, since it uses less digits than its factorization.
235494357061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14580.
The product of its (nonzero) digits is 2721600, while the sum is 49.
The spelling of 235494357061 in words is "two hundred thirty-five billion, four hundred ninety-four million, three hundred fifty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •