Base | Representation |
---|---|
bin | 1110100000111… |
… | …11010100011100 |
3 | 22111010012120110 |
4 | 13100133110130 |
5 | 222132404400 |
6 | 20025450020 |
7 | 3005653314 |
oct | 720372434 |
9 | 274105513 |
10 | 121763100 |
11 | 62806468 |
12 | 34940910 |
13 | 1c2c3594 |
14 | 12258444 |
15 | aa52e50 |
hex | 741f51c |
121763100 has 72 divisors (see below), whose sum is σ = 360532480. Its totient is φ = 31711680.
The previous prime is 121763087. The next prime is 121763113. The reversal of 121763100 is 1367121.
It is an interprime number because it is at equal distance from previous prime (121763087) and next prime (121763113).
It is a super-2 number, since 2×1217631002 = 29652505043220000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8181 + ... + 17619.
Almost surely, 2121763100 is an apocalyptic number.
121763100 is a gapful number since it is divisible by the number (10) 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 121763100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180266240).
121763100 is an abundant number, since it is smaller than the sum of its proper divisors (238769380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121763100 is a wasteful number, since it uses less digits than its factorization.
121763100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9499 (or 9492 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 21.
The square root of 121763100 is about 11034.6318470532. The cubic root of 121763100 is about 495.6463345559.
The spelling of 121763100 in words is "one hundred twenty-one million, seven hundred sixty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •