Base | Representation |
---|---|
bin | 11111000000111011011… |
… | …000110010100101011101 |
3 | 21112202020222012201001212 |
4 | 133000323120302211131 |
5 | 234404400313230323 |
6 | 4311034502314205 |
7 | 306660414136166 |
oct | 37007330624535 |
9 | 7482228181055 |
10 | 2131300133213 |
11 | 7519743a9279 |
12 | 2a5088128965 |
13 | 125c998bc6a4 |
14 | 752268b276d |
15 | 3a69005ab78 |
hex | 1f03b63295d |
2131300133213 has 4 divisors (see below), whose sum is σ = 2131315253340. Its totient is φ = 2131285013088.
The previous prime is 2131300133203. The next prime is 2131300133257. The reversal of 2131300133213 is 3123310031312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1141269163204 + 990030970009 = 1068302^2 + 995003^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131300133213 - 228 = 2131031697757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131300133203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7346618 + ... + 7631211.
It is an arithmetic number, because the mean of its divisors is an integer number (532828813335).
Almost surely, 22131300133213 is an apocalyptic number.
It is an amenable number.
2131300133213 is a deficient number, since it is larger than the sum of its proper divisors (15120127).
2131300133213 is a wasteful number, since it uses less digits than its factorization.
2131300133213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15120126.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 2131300133213 its reverse (3123310031312), we get a palindrome (5254610164525).
The spelling of 2131300133213 in words is "two trillion, one hundred thirty-one billion, three hundred million, one hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •