Base | Representation |
---|---|
bin | 10010111000111101… |
… | …10000001100110101 |
3 | 222011210000120221000 |
4 | 21130132300030311 |
5 | 131232211001323 |
6 | 4354155313513 |
7 | 506213221005 |
oct | 113436601465 |
9 | 28153016830 |
10 | 10141500213 |
11 | 4334681239 |
12 | 1b7044b899 |
13 | c58101600 |
14 | 6c2c78005 |
15 | 3e550de43 |
hex | 25c7b0335 |
10141500213 has 48 divisors (see below), whose sum is σ = 16388835840. Its totient is φ = 6194987136.
The previous prime is 10141500197. The next prime is 10141500217. The reversal of 10141500213 is 31200514101.
10141500213 is a `hidden beast` number, since 1 + 0 + 141 + 500 + 21 + 3 = 666.
10141500213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10141500213 - 24 = 10141500197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141500217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 617020 + ... + 633242.
It is an arithmetic number, because the mean of its divisors is an integer number (341434080).
Almost surely, 210141500213 is an apocalyptic number.
10141500213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10141500213 is a deficient number, since it is larger than the sum of its proper divisors (6247335627).
10141500213 is a wasteful number, since it uses less digits than its factorization.
10141500213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16395 (or 16376 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The spelling of 10141500213 in words is "ten billion, one hundred forty-one million, five hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •