Base | Representation |
---|---|
bin | 1101101100111101010… |
… | …0100101111100101101 |
3 | 211111121212220001120100 |
4 | 3123033110211330231 |
5 | 12324103032003023 |
6 | 300051054341313 |
7 | 23002410241134 |
oct | 3331724457455 |
9 | 744555801510 |
10 | 235406516013 |
11 | 90920928789 |
12 | 397591ba839 |
13 | 19277826276 |
14 | b5725aa91b |
15 | 61cba53c43 |
hex | 36cf525f2d |
235406516013 has 12 divisors (see below), whose sum is σ = 340035839260. Its totient is φ = 156935736576.
The previous prime is 235406515973. The next prime is 235406516029. The reversal of 235406516013 is 310615604532.
235406516013 is a `hidden beast` number, since 2 + 3 + 5 + 40 + 6 + 5 + 1 + 601 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 116244856809 + 119161659204 = 340947^2 + 345198^2 .
It is not a de Polignac number, because 235406516013 - 210 = 235406514989 is a prime.
It is a super-3 number, since 3×2354065160133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (235406616013) 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 11 ways as a sum of consecutive naturals, for example, 1367133 + ... + 1529661.
Almost surely, 2235406516013 is an apocalyptic number.
It is an amenable number.
235406516013 is a deficient number, since it is larger than the sum of its proper divisors (104629323247).
235406516013 is a wasteful number, since it uses less digits than its factorization.
235406516013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323468 (or 323465 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 235406516013 in words is "two hundred thirty-five billion, four hundred six million, five hundred sixteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •