Base | Representation |
---|---|
bin | 1011001011100001… |
… | …1000101011110110 |
3 | 21202011010222101211 |
4 | 2302320120223312 |
5 | 22121242004442 |
6 | 1213444312034 |
7 | 134241101245 |
oct | 26270305366 |
9 | 7664128354 |
10 | 3001125622 |
11 | 130006a110 |
12 | 6b90a261a |
13 | 38a9b99a1 |
14 | 20681a95c |
15 | 128717617 |
hex | b2e18af6 |
3001125622 has 8 divisors (see below), whose sum is σ = 4910932872. Its totient is φ = 1364148000.
The previous prime is 3001125613. The next prime is 3001125643. The reversal of 3001125622 is 2265211003.
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: 136414801 = 3001125622 / (3 + 0 + 0 + 1 + 1 + 2 + 5 + 6 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 3001125593 and 3001125602.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 68207379 + ... + 68207422.
It is an arithmetic number, because the mean of its divisors is an integer number (613866609).
Almost surely, 23001125622 is an apocalyptic number.
3001125622 is a deficient number, since it is larger than the sum of its proper divisors (1909807250).
3001125622 is a wasteful number, since it uses less digits than its factorization.
3001125622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136414814.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 3001125622 is about 54782.5302628493. The cubic root of 3001125622 is about 1442.4299286238.
Adding to 3001125622 its reverse (2265211003), we get a palindrome (5266336625).
The spelling of 3001125622 in words is "three billion, one million, one hundred twenty-five thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •