Base | Representation |
---|---|
bin | 110000010101111… |
… | …0101111110010001 |
3 | 11012001021112010001 |
4 | 1200223311332101 |
5 | 11310224343001 |
6 | 424543210001 |
7 | 55124450005 |
oct | 14053657621 |
9 | 4161245101 |
10 | 1622106001 |
11 | 76270027a |
12 | 3932a6901 |
13 | 1cb0a5949 |
14 | 11560a705 |
15 | 97619001 |
hex | 60af5f91 |
1622106001 has 8 divisors (see below), whose sum is σ = 1667812608. Its totient is φ = 1576692000.
The previous prime is 1622105963. The next prime is 1622106007. The reversal of 1622106001 is 1006012261.
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 1622106001 - 211 = 1622103953 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1622106001.
It is not an unprimeable number, because it can be changed into a prime (1622106007) 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, 61885 + ... + 84106.
It is an arithmetic number, because the mean of its divisors is an integer number (208476576).
Almost surely, 21622106001 is an apocalyptic number.
It is an amenable number.
1622106001 is a deficient number, since it is larger than the sum of its proper divisors (45706607).
1622106001 is a wasteful number, since it uses less digits than its factorization.
1622106001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146303.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 1622106001 is about 40275.3771056212. The cubic root of 1622106001 is about 1174.9690050071.
Adding to 1622106001 its reverse (1006012261), we get a palindrome (2628118262).
The spelling of 1622106001 in words is "one billion, six hundred twenty-two million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •