Base | Representation |
---|---|
bin | 10010111010100100… |
… | …10010100010100101 |
3 | 222012201102222011101 |
4 | 21131102102202211 |
5 | 131244140311323 |
6 | 4355401040101 |
7 | 506436106525 |
oct | 113522224245 |
9 | 28181388141 |
10 | 10155010213 |
11 | 4341269527 |
12 | 1b74a86031 |
13 | c5ab519aa |
14 | 6c4993685 |
15 | 3e67cbdad |
hex | 25d4928a5 |
10155010213 has 8 divisors (see below), whose sum is σ = 10216398168. Its totient is φ = 10093653504.
The previous prime is 10155010193. The next prime is 10155010259. The reversal of 10155010213 is 31201055101.
It can be written as a sum of positive squares in 4 ways, for example, as 6671295684 + 3483714529 = 81678^2 + 59023^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10155010213 - 25 = 10155010181 is a prime.
It is a super-2 number, since 2×101550102132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10155010013) 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, 1161145 + ... + 1169857.
It is an arithmetic number, because the mean of its divisors is an integer number (1277049771).
Almost surely, 210155010213 is an apocalyptic number.
It is an amenable number.
10155010213 is a deficient number, since it is larger than the sum of its proper divisors (61387955).
10155010213 is an equidigital number, since it uses as much as digits as its factorization.
10155010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15623.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 10155010213 its reverse (31201055101), we get a palindrome (41356065314).
The spelling of 10155010213 in words is "ten billion, one hundred fifty-five million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •