Base | Representation |
---|---|
bin | 110000111101011110… |
… | …1000011011101010001 |
3 | 101001101112022001121111 |
4 | 1201322331003131101 |
5 | 3210312330243101 |
6 | 120145050453321 |
7 | 10411342411636 |
oct | 1417275033521 |
9 | 331345261544 |
10 | 105142040401 |
11 | 40654a39172 |
12 | 18463a34241 |
13 | 9bb7c112b8 |
14 | 5135d3818d |
15 | 2b0589c251 |
hex | 187af43751 |
105142040401 has 8 divisors (see below), whose sum is σ = 106189663464. Its totient is φ = 104094547200.
The previous prime is 105142040389. The next prime is 105142040411. The reversal of 105142040401 is 104040241501.
It can be written as a sum of positive squares in 4 ways, for example, as 24556457025 + 80585583376 = 156705^2 + 283876^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 105142040401 - 235 = 70782302033 is a prime.
It is a super-2 number, since 2×1051420404012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105142040411) 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, 2941231 + ... + 2976763.
It is an arithmetic number, because the mean of its divisors is an integer number (13273707933).
Almost surely, 2105142040401 is an apocalyptic number.
It is an amenable number.
105142040401 is a deficient number, since it is larger than the sum of its proper divisors (1047623063).
105142040401 is a wasteful number, since it uses less digits than its factorization.
105142040401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64931.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 105142040401 its reverse (104040241501), we get a palindrome (209182281902).
The spelling of 105142040401 in words is "one hundred five billion, one hundred forty-two million, forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •