Base | Representation |
---|---|
bin | 101111110011000000010011… |
… | …001100001111110101101011 |
3 | 1000120022012000102202012001120 |
4 | 233303000103030033311223 |
5 | 210023113114014010011 |
6 | 2023030340030350323 |
7 | 62164255044150402 |
oct | 5763002314176553 |
9 | 1016265012665046 |
10 | 210213201313131 |
11 | 60a86a10992505 |
12 | 1b6b088795b3a3 |
13 | 903b034732153 |
14 | 39ca532204639 |
15 | 19481db3c1a06 |
hex | bf301330fd6b |
210213201313131 has 8 divisors (see below), whose sum is σ = 289325696431104. Its totient is φ = 135621420201960.
The previous prime is 210213201313109. The next prime is 210213201313217. The reversal of 210213201313131 is 131313102312012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210213201313131 - 229 = 210212664442219 is a prime.
It is a super-2 number, since 2×2102132013131312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210213201313231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1130178501591 + ... + 1130178501776.
It is an arithmetic number, because the mean of its divisors is an integer number (36165712053888).
Almost surely, 2210213201313131 is an apocalyptic number.
210213201313131 is a deficient number, since it is larger than the sum of its proper divisors (79112495117973).
210213201313131 is a wasteful number, since it uses less digits than its factorization.
210213201313131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2260357003401.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 210213201313131 its reverse (131313102312012), we get a palindrome (341526303625143).
The spelling of 210213201313131 in words is "two hundred ten trillion, two hundred thirteen billion, two hundred one million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •