Base | Representation |
---|---|
bin | 101000010011011… |
… | …0001001000110110 |
3 | 10111020122222202111 |
4 | 1100212301020312 |
5 | 10232144340042 |
6 | 342105201234 |
7 | 45340462165 |
oct | 12046611066 |
9 | 3436588674 |
10 | 1352340022 |
11 | 6343a7090 |
12 | 318a9021a |
13 | 1872324c7 |
14 | cb8673dc |
15 | 7dacd517 |
hex | 509b1236 |
1352340022 has 8 divisors (see below), whose sum is σ = 2212920072. Its totient is φ = 614700000.
The previous prime is 1352339921. The next prime is 1352340061. The reversal of 1352340022 is 2200432531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 61470001 = 1352340022 / (1 + 3 + 5 + 2 + 3 + 4 + 0 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1352339975 and 1352340002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30734979 + ... + 30735022.
It is an arithmetic number, because the mean of its divisors is an integer number (276615009).
Almost surely, 21352340022 is an apocalyptic number.
1352340022 is a deficient number, since it is larger than the sum of its proper divisors (860580050).
1352340022 is a wasteful number, since it uses less digits than its factorization.
1352340022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61470014.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 1352340022 is about 36774.1760206806. The cubic root of 1352340022 is about 1105.8476524545.
Adding to 1352340022 its reverse (2200432531), we get a palindrome (3552772553).
The spelling of 1352340022 in words is "one billion, three hundred fifty-two million, three hundred forty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •