Base | Representation |
---|---|
bin | 10011101000101111… |
… | …01100111101001101 |
3 | 1000012201012120212111 |
4 | 21310113230331031 |
5 | 133042312230401 |
6 | 4502034104021 |
7 | 522151054246 |
oct | 116427547515 |
9 | 30181176774 |
10 | 10542305101 |
11 | 451a946949 |
12 | 206271b011 |
13 | cc0165373 |
14 | 7201abccd |
15 | 41a7d0e51 |
hex | 2745ecf4d |
10542305101 has 8 divisors (see below), whose sum is σ = 10743072120. Its totient is φ = 10341606912.
The previous prime is 10542305099. The next prime is 10542305107. The reversal of 10542305101 is 10150324501.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2202049476 + 8340255625 = 46926^2 + 91325^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 10542305101 - 21 = 10542305099 is a prime.
It is a super-2 number, since 2×105423051012 (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 (10542305107) 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, 377061 + ... + 404053.
It is an arithmetic number, because the mean of its divisors is an integer number (1342884015).
Almost surely, 210542305101 is an apocalyptic number.
It is an amenable number.
10542305101 is a deficient number, since it is larger than the sum of its proper divisors (200767019).
10542305101 is an equidigital number, since it uses as much as digits as its factorization.
10542305101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34415.
The product of its (nonzero) digits is 600, while the sum is 22.
Adding to 10542305101 its reverse (10150324501), we get a palindrome (20692629602).
The spelling of 10542305101 in words is "ten billion, five hundred forty-two million, three hundred five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •