Base | Representation |
---|---|
bin | 111101110101001… |
… | …0100001000110100 |
3 | 12100120220011210002 |
4 | 1323222110020310 |
5 | 13222110040400 |
6 | 541511450432 |
7 | 102261401120 |
oct | 17352241064 |
9 | 5316804702 |
10 | 2074690100 |
11 | 97512141a |
12 | 49a986a18 |
13 | 270a988a2 |
14 | 15977c580 |
15 | c2217ed5 |
hex | 7ba94234 |
2074690100 has 72 divisors (see below), whose sum is σ = 5210499840. Its totient is φ = 702299520.
The previous prime is 2074690087. The next prime is 2074690103. The reversal of 2074690100 is 10964702.
It is a super-2 number, since 2×20746901002 = 8608678022076020000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2074690103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36542 + ... + 74058.
Almost surely, 22074690100 is an apocalyptic number.
2074690100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2074690100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2605249920).
2074690100 is an abundant number, since it is smaller than the sum of its proper divisors (3135809740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2074690100 is a wasteful number, since it uses less digits than its factorization.
2074690100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37617 (or 37610 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 29.
The square root of 2074690100 is about 45548.7661742884. The cubic root of 2074690100 is about 1275.4137014553.
The spelling of 2074690100 in words is "two billion, seventy-four million, six hundred ninety thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •