Base | Representation |
---|---|
bin | 1101101100111101000… |
… | …1000111110100000001 |
3 | 211111121211011211110112 |
4 | 3123033101013310001 |
5 | 12324102313344040 |
6 | 300051023041105 |
7 | 23002366431353 |
oct | 3331721076401 |
9 | 744554154415 |
10 | 235405606145 |
11 | 90920367126 |
12 | 39758a40195 |
13 | 19277598098 |
14 | b5724110d3 |
15 | 61cb924365 |
hex | 36cf447d01 |
235405606145 has 8 divisors (see below), whose sum is σ = 282875296704. Its totient is φ = 188065438704.
The previous prime is 235405606129. The next prime is 235405606151. The reversal of 235405606145 is 541606504532.
It is a happy number.
235405606145 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 235405606145 - 24 = 235405606129 is a prime.
It is a super-2 number, since 2×2354056061452 (a number of 24 digits) contains 22 as substring.
It is a Duffinian 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 7 ways as a sum of consecutive naturals, for example, 32376779 + ... + 32384048.
It is an arithmetic number, because the mean of its divisors is an integer number (35359412088).
Almost surely, 2235405606145 is an apocalyptic number.
It is an amenable number.
235405606145 is a deficient number, since it is larger than the sum of its proper divisors (47469690559).
235405606145 is an equidigital number, since it uses as much as digits as its factorization.
235405606145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64761559.
The product of its (nonzero) digits is 432000, while the sum is 41.
The spelling of 235405606145 in words is "two hundred thirty-five billion, four hundred five million, six hundred six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •