Base | Representation |
---|---|
bin | 110000001001… |
… | …100011100010 |
3 | 212202021012100 |
4 | 300021203202 |
5 | 11212401200 |
6 | 1130311230 |
7 | 212166660 |
oct | 60114342 |
9 | 25667170 |
10 | 12622050 |
11 | 7141151 |
12 | 4288516 |
13 | 27cc18c |
14 | 1967c30 |
15 | 1194d00 |
hex | c098e2 |
12622050 has 72 divisors (see below), whose sum is σ = 38765376. Its totient is φ = 2884320.
The previous prime is 12622033. The next prime is 12622073. The reversal of 12622050 is 5022621.
It is a super-2 number, since 2×126220502 = 318632292405000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1147 + ... + 5153.
It is an arithmetic number, because the mean of its divisors is an integer number (538408).
Almost surely, 212622050 is an apocalyptic number.
12622050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12622050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19382688).
12622050 is an abundant number, since it is smaller than the sum of its proper divisors (26143326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12622050 is a wasteful number, since it uses less digits than its factorization.
12622050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4032 (or 4024 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 12622050 is about 3552.7524540840. The cubic root of 12622050 is about 232.8323377688.
Adding to 12622050 its reverse (5022621), we get a palindrome (17644671).
The spelling of 12622050 in words is "twelve million, six hundred twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •