Base | Representation |
---|---|
bin | 10011101001100001110… |
… | …100111101001111011111 |
3 | 11210002021000021221222100 |
4 | 103221201310331033133 |
5 | 134110313304100411 |
6 | 2512145031220143 |
7 | 166360504104450 |
oct | 23514164751737 |
9 | 4702230257870 |
10 | 1350261003231 |
11 | 480708153898 |
12 | 199833817653 |
13 | 9a437c5cc3a |
14 | 494d281b127 |
15 | 251cb674456 |
hex | 13a61d3d3df |
1350261003231 has 12 divisors (see below), whose sum is σ = 2229002291152. Its totient is φ = 771577716096.
The previous prime is 1350261003187. The next prime is 1350261003253. The reversal of 1350261003231 is 1323001620531.
1350261003231 is a `hidden beast` number, since 13 + 5 + 0 + 2 + 610 + 0 + 3 + 2 + 31 = 666.
It is not a de Polignac number, because 1350261003231 - 211 = 1350261001183 is a prime.
It is a super-2 number, since 2×13502610032312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1350261003195 and 1350261003204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350261003271) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10716357106 + ... + 10716357231.
Almost surely, 21350261003231 is an apocalyptic number.
1350261003231 is a deficient number, since it is larger than the sum of its proper divisors (878741287921).
1350261003231 is a wasteful number, since it uses less digits than its factorization.
1350261003231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21432714350 (or 21432714347 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 1350261003231 its reverse (1323001620531), we get a palindrome (2673262623762).
The spelling of 1350261003231 in words is "one trillion, three hundred fifty billion, two hundred sixty-one million, three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •