Base | Representation |
---|---|
bin | 100011100111101001101111… |
… | …1110110110111010111000001 |
3 | 1112002100102200202122020201222 |
4 | 1013033103133312313113001 |
5 | 312031310041140312210 |
6 | 3030210004032204425 |
7 | 122665055650442303 |
oct | 10717233766672701 |
9 | 1462312622566658 |
10 | 313313030010305 |
11 | 90916345429076 |
12 | 2b1821b7999715 |
13 | 105a93a456a3b0 |
14 | 57526082db973 |
15 | 2634ece583655 |
hex | 11cf4dfdb75c1 |
313313030010305 has 32 divisors (see below), whose sum is σ = 405456583408800. Its totient is φ = 231049971597312.
The previous prime is 313313030010301. The next prime is 313313030010311. The reversal of 313313030010305 is 503010030313313.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 244417203287104 + 68895826723201 = 15633848^2 + 8300351^2 .
It is a cyclic number.
It is not a de Polignac number, because 313313030010305 - 22 = 313313030010301 is a prime.
It is not an unprimeable number, because it can be changed into a prime (313313030010301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 146959181 + ... + 149075909.
It is an arithmetic number, because the mean of its divisors is an integer number (12670518231525).
Almost surely, 2313313030010305 is an apocalyptic number.
It is an amenable number.
313313030010305 is a deficient number, since it is larger than the sum of its proper divisors (92143553398495).
313313030010305 is a wasteful number, since it uses less digits than its factorization.
313313030010305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2119893.
The product of its (nonzero) digits is 3645, while the sum is 26.
Adding to 313313030010305 its reverse (503010030313313), we get a palindrome (816323060323618).
The spelling of 313313030010305 in words is "three hundred thirteen trillion, three hundred thirteen billion, thirty million, ten thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •