Base | Representation |
---|---|
bin | 100011100111101110111000… |
… | …0001111011111101010000001 |
3 | 1112002101111010020020120102000 |
4 | 1013033131300033133222001 |
5 | 312032000114313224023 |
6 | 3030215024500214213 |
7 | 122665625566516050 |
oct | 10717356017375201 |
9 | 1462344106216360 |
10 | 313324042320513 |
11 | 9091aa86604794 |
12 | 2b18436b99a369 |
13 | 105aa43abb4c93 |
14 | 5752d70a94397 |
15 | 2635426255243 |
hex | 11cf7703dfa81 |
313324042320513 has 64 divisors (see below), whose sum is σ = 552736810752000. Its totient is φ = 171624778903872.
The previous prime is 313324042320473. The next prime is 313324042320529. The reversal of 313324042320513 is 315023240423313.
313324042320513 is a `hidden beast` number, since 3 + 1 + 3 + 3 + 2 + 404 + 232 + 0 + 5 + 13 = 666.
It is not a de Polignac number, because 313324042320513 - 29 = 313324042320001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (313324042322513) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 204869395 + ... + 206393112.
It is an arithmetic number, because the mean of its divisors is an integer number (8636512668000).
Almost surely, 2313324042320513 is an apocalyptic number.
It is an amenable number.
313324042320513 is a deficient number, since it is larger than the sum of its proper divisors (239412768431487).
313324042320513 is a wasteful number, since it uses less digits than its factorization.
313324042320513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411262691 (or 411262685 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 36.
Adding to 313324042320513 its reverse (315023240423313), we get a palindrome (628347282743826).
The spelling of 313324042320513 in words is "three hundred thirteen trillion, three hundred twenty-four billion, forty-two million, three hundred twenty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •