Base | Representation |
---|---|
bin | 110000100000000110011010… |
… | …010101101110000111010101 |
3 | 1000222021102220210212200021100 |
4 | 300200012122111232013111 |
5 | 210424401230334003023 |
6 | 2033402124440340313 |
7 | 62634202454443644 |
oct | 6040063225560725 |
9 | 1028242823780240 |
10 | 213312140141013 |
11 | 61a71197089a31 |
12 | 1bb113a4174699 |
13 | 920432cc66c94 |
14 | 3a9651124935b |
15 | 199db11ad8c43 |
hex | c2019a56e1d5 |
213312140141013 has 48 divisors (see below), whose sum is σ = 309962676703680. Its totient is φ = 141358891737600.
The previous prime is 213312140140927. The next prime is 213312140141021. The reversal of 213312140141013 is 310141041213312.
213312140141013 is a `hidden beast` number, since 2 + 1 + 3 + 31 + 214 + 0 + 1 + 410 + 1 + 3 = 666.
It is not a de Polignac number, because 213312140141013 - 218 = 213312139878869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213312140141083) 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, 2624273670 + ... + 2624354952.
It is an arithmetic number, because the mean of its divisors is an integer number (6457555764660).
Almost surely, 2213312140141013 is an apocalyptic number.
It is an amenable number.
213312140141013 is a deficient number, since it is larger than the sum of its proper divisors (96650536562667).
213312140141013 is a wasteful number, since it uses less digits than its factorization.
213312140141013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83730 (or 83727 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 213312140141013 its reverse (310141041213312), we get a palindrome (523453181354325).
The spelling of 213312140141013 in words is "two hundred thirteen trillion, three hundred twelve billion, one hundred forty million, one hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •