Base | Representation |
---|---|
bin | 1101101101000001101… |
… | …0111110000100100101 |
3 | 211111200011121100200111 |
4 | 3123100122332010211 |
5 | 12324122242334101 |
6 | 300052554013021 |
7 | 23003023120030 |
oct | 3332032760445 |
9 | 744604540614 |
10 | 235424964901 |
11 | 909302896a5 |
12 | 39763417171 |
13 | 1927b5b5679 |
14 | b574c10017 |
15 | 61cd49a251 |
hex | 36d06be125 |
235424964901 has 8 divisors (see below), whose sum is σ = 269585706240. Its totient is φ = 201396374448.
The previous prime is 235424964883. The next prime is 235424964923. The reversal of 235424964901 is 109469424532.
235424964901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 235424964901 - 27 = 235424964773 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (235424964961) 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 7 ways as a sum of consecutive naturals, for example, 33033901 + ... + 33041026.
It is an arithmetic number, because the mean of its divisors is an integer number (33698213280).
Almost surely, 2235424964901 is an apocalyptic number.
It is an amenable number.
235424964901 is a deficient number, since it is larger than the sum of its proper divisors (34160741339).
235424964901 is an equidigital number, since it uses as much as digits as its factorization.
235424964901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66075443.
The product of its (nonzero) digits is 1866240, while the sum is 49.
The spelling of 235424964901 in words is "two hundred thirty-five billion, four hundred twenty-four million, nine hundred sixty-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •