Base | Representation |
---|---|
bin | 10011000111101000110… |
… | …001110110010100101000 |
3 | 11122121022212222010120011 |
4 | 103013220301312110220 |
5 | 133011301311010302 |
6 | 2443330030341304 |
7 | 163631635122535 |
oct | 23075061662450 |
9 | 4577285863504 |
10 | 1313870406952 |
11 | 467233657234 |
12 | 19277865a834 |
13 | 96b88900b2c |
14 | 4783d769d8c |
15 | 2429b9aa5d7 |
hex | 131e8c76528 |
1313870406952 has 16 divisors (see below), whose sum is σ = 2467661333940. Its totient is φ = 655827384576.
The previous prime is 1313870406851. The next prime is 1313870406983. The reversal of 1313870406952 is 2596040783131.
It can be written as a sum of positive squares in 2 ways, for example, as 1288165980676 + 25704426276 = 1134974^2 + 160326^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1313870406896 and 1313870406905.
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 3 ways as a sum of consecutive naturals, for example, 138472323 + ... + 138481810.
It is a 1-persistent number, because it is pandigital, but 2⋅1313870406952 = 2627740813904 is not.
Almost surely, 21313870406952 is an apocalyptic number.
It is an amenable number.
1313870406952 is a deficient number, since it is larger than the sum of its proper divisors (1153790926988).
1313870406952 is a wasteful number, since it uses less digits than its factorization.
1313870406952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276954732 (or 276954728 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 49.
The spelling of 1313870406952 in words is "one trillion, three hundred thirteen billion, eight hundred seventy million, four hundred six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •