Base | Representation |
---|---|
bin | 100011100110111111000011… |
… | …0000111001000101101001000 |
3 | 1112002000200000000220201201111 |
4 | 1013031332012013020231020 |
5 | 312023304240440404000 |
6 | 3030055520443100104 |
7 | 122655331356354343 |
oct | 10715760607105510 |
9 | 1462020000821644 |
10 | 313221330013000 |
11 | 90890469146932 |
12 | 2b168485811634 |
13 | 105a084c49cb66 |
14 | 574bdc971945a |
15 | 2632913d53cba |
hex | 11cdf861c8b48 |
313221330013000 has 64 divisors (see below), whose sum is σ = 733260939980400. Its totient is φ = 125233313587200.
The previous prime is 313221330012961. The next prime is 313221330013027. The reversal of 313221330013000 is 310033122313.
It can be written as a sum of positive squares in 8 ways, for example, as 41839066116 + 313179490946884 = 204546^2 + 17696878^2 .
It is a super-2 number, since 2×3132213300130002 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66752889 + ... + 71290888.
Almost surely, 2313221330013000 is an apocalyptic number.
It is an amenable number.
313221330013000 is an abundant number, since it is smaller than the sum of its proper divisors (420039609967400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313221330013000 is a wasteful number, since it uses less digits than its factorization.
313221330013000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138046067 (or 138046053 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 313221330013000 its reverse (310033122313), we get a palindrome (313531363135313).
The spelling of 313221330013000 in words is "three hundred thirteen trillion, two hundred twenty-one billion, three hundred thirty million, thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •