Base | Representation |
---|---|
bin | 1011110100101101111001… |
… | …0001101010100000100110 |
3 | 1201000211001021101210021022 |
4 | 2331023132101222200212 |
5 | 3200444103323211324 |
6 | 43352131103051142 |
7 | 2511145362345002 |
oct | 275133621524046 |
9 | 51024037353238 |
10 | 13000300210214 |
11 | 416243a608109 |
12 | 155b6662a0ab2 |
13 | 733bccc2aab5 |
14 | 32d309c51702 |
15 | 17827abd805e |
hex | bd2de46a826 |
13000300210214 has 8 divisors (see below), whose sum is σ = 19512768987360. Its totient is φ = 6496043881096.
The previous prime is 13000300210213. The next prime is 13000300210259. The reversal of 13000300210214 is 41201200300031.
13000300210214 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13000300210192 and 13000300210201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000300210213) 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, 2053108049 + ... + 2053114380.
It is an arithmetic number, because the mean of its divisors is an integer number (2439096123420).
Almost surely, 213000300210214 is an apocalyptic number.
13000300210214 is a deficient number, since it is larger than the sum of its proper divisors (6512468777146).
13000300210214 is a wasteful number, since it uses less digits than its factorization.
13000300210214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4106224014.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 13000300210214 its reverse (41201200300031), we get a palindrome (54201500510245).
The spelling of 13000300210214 in words is "thirteen trillion, three hundred million, two hundred ten thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •