Base | Representation |
---|---|
bin | 110000010000110001… |
… | …1010101110011110001 |
3 | 100220111222221121001120 |
4 | 1200201203111303301 |
5 | 3144224341040401 |
6 | 115340150252453 |
7 | 10326230356215 |
oct | 1404143256361 |
9 | 326458847046 |
10 | 103642127601 |
11 | 3aa55308511 |
12 | 18105657129 |
13 | 9a0924c92c |
14 | 5032a58945 |
15 | 2a68d6d836 |
hex | 18218d5cf1 |
103642127601 has 32 divisors (see below), whose sum is σ = 144335088000. Its totient is φ = 66070609920.
The previous prime is 103642127587. The next prime is 103642127651. The reversal of 103642127601 is 106721246301.
It is not a de Polignac number, because 103642127601 - 215 = 103642094833 is a prime.
It is a super-3 number, since 3×1036421276013 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (103642127651) 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 31 ways as a sum of consecutive naturals, for example, 4486641 + ... + 4509681.
It is an arithmetic number, because the mean of its divisors is an integer number (4510471500).
Almost surely, 2103642127601 is an apocalyptic number.
It is an amenable number.
103642127601 is a deficient number, since it is larger than the sum of its proper divisors (40692960399).
103642127601 is a wasteful number, since it uses less digits than its factorization.
103642127601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23569.
The product of its (nonzero) digits is 12096, while the sum is 33.
The spelling of 103642127601 in words is "one hundred three billion, six hundred forty-two million, one hundred twenty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •