Base | Representation |
---|---|
bin | 10011100111010010… |
… | …00101000100011101 |
3 | 1000011212012122102211 |
4 | 21303221011010131 |
5 | 133031200124401 |
6 | 4500520120421 |
7 | 521642141506 |
oct | 116351050435 |
9 | 30155178384 |
10 | 10530083101 |
11 | 4513a5931a |
12 | 205a606111 |
13 | cba776305 |
14 | 71c709bad |
15 | 4196b9951 |
hex | 273a4511d |
10530083101 has 8 divisors (see below), whose sum is σ = 11220518520. Its totient is φ = 9847538688.
The previous prime is 10530083099. The next prime is 10530083107. The reversal of 10530083101 is 10138003501.
It can be written as a sum of positive squares in 4 ways, for example, as 384356025 + 10145727076 = 19605^2 + 100726^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 10530083101 - 21 = 10530083099 is a prime.
It is a super-2 number, since 2×105300831012 (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 (10530083107) 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, 1969996 + ... + 1975333.
It is an arithmetic number, because the mean of its divisors is an integer number (1402564815).
Almost surely, 210530083101 is an apocalyptic number.
It is an amenable number.
10530083101 is a deficient number, since it is larger than the sum of its proper divisors (690435419).
10530083101 is a wasteful number, since it uses less digits than its factorization.
10530083101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3945503.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 10530083101 its reverse (10138003501), we get a palindrome (20668086602).
The spelling of 10530083101 in words is "ten billion, five hundred thirty million, eighty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •