Base | Representation |
---|---|
bin | 111110101110101… |
… | …000000011110101 |
3 | 2201100021222020220 |
4 | 332232220003311 |
5 | 4123404110401 |
6 | 252232444553 |
7 | 35036224011 |
oct | 7656500365 |
9 | 2640258226 |
10 | 1052410101 |
11 | 4a0070316 |
12 | 254549759 |
13 | 13a05a592 |
14 | 9dab1541 |
15 | 625d5336 |
hex | 3eba80f5 |
1052410101 has 8 divisors (see below), whose sum is σ = 1405908864. Its totient is φ = 700259040.
The previous prime is 1052410097. The next prime is 1052410111. The reversal of 1052410101 is 1010142501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1052410101 - 22 = 1052410097 is a prime.
It is a super-2 number, since 2×10524101012 = 2215134041373660402, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052410111) 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 7 ways as a sum of consecutive naturals, for example, 335101 + ... + 338226.
It is an arithmetic number, because the mean of its divisors is an integer number (175738608).
Almost surely, 21052410101 is an apocalyptic number.
It is an amenable number.
1052410101 is a deficient number, since it is larger than the sum of its proper divisors (353498763).
1052410101 is an equidigital number, since it uses as much as digits as its factorization.
1052410101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673851.
The product of its (nonzero) digits is 40, while the sum is 15.
The square root of 1052410101 is about 32440.8708421953. The cubic root of 1052410101 is about 1017.1734190471.
Adding to 1052410101 its reverse (1010142501), we get a palindrome (2062552602).
The spelling of 1052410101 in words is "one billion, fifty-two million, four hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •