Base | Representation |
---|---|
bin | 10011000111001111101… |
… | …110111110011010010101 |
3 | 11122120020121022120212221 |
4 | 103013033232332122111 |
5 | 133004421224121003 |
6 | 2443220220342341 |
7 | 163615343455300 |
oct | 23071756763225 |
9 | 4576217276787 |
10 | 1313450223253 |
11 | 467038455a83 |
12 | 19267b9a49b1 |
13 | 96b1c84361c |
14 | 477dda2db37 |
15 | 24274b5b7bd |
hex | 131cfbbe695 |
1313450223253 has 48 divisors (see below), whose sum is σ = 1571874148080. Its totient is φ = 1093879987200.
The previous prime is 1313450223139. The next prime is 1313450223313. The reversal of 1313450223253 is 3523220543131.
It can be written as a sum of positive squares in 8 ways, for example, as 19082107044 + 1294368116209 = 138138^2 + 1137703^2 .
It is not a de Polignac number, because 1313450223253 - 29 = 1313450222741 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 (1313450223853) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 429090343 + ... + 429093403.
It is an arithmetic number, because the mean of its divisors is an integer number (32747378085).
Almost surely, 21313450223253 is an apocalyptic number.
It is an amenable number.
1313450223253 is a deficient number, since it is larger than the sum of its proper divisors (258423924827).
1313450223253 is a wasteful number, since it uses less digits than its factorization.
1313450223253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4838 (or 4831 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 1313450223253 its reverse (3523220543131), we get a palindrome (4836670766384).
The spelling of 1313450223253 in words is "one trillion, three hundred thirteen billion, four hundred fifty million, two hundred twenty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •