Base | Representation |
---|---|
bin | 10110101110010000… |
… | …10000111011000100 |
3 | 1011111011221200210211 |
4 | 23113020100323010 |
5 | 144440443440000 |
6 | 5334303125204 |
7 | 611210340022 |
oct | 132710207304 |
9 | 34434850724 |
10 | 12199202500 |
11 | 51a014a441 |
12 | 24455a3804 |
13 | 11c54ccb24 |
14 | 83a273712 |
15 | 4b5ebd7ba |
hex | 2d7210ec4 |
12199202500 has 75 divisors (see below), whose sum is σ = 27257155387. Its totient is φ = 4775858000.
The previous prime is 12199202471. The next prime is 12199202513. The reversal of 12199202500 is 520299121.
The square root of 12199202500 is 110450.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 956417476 + 11242785024 = 30926^2 + 106032^2 .
It is an ABA number since it can be written as A⋅BA, here for A=4, B=235.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 24 ways as a sum of consecutive naturals, for example, 259557477 + ... + 259557523.
Almost surely, 212199202500 is an apocalyptic number.
12199202500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12199202500 is the 110450-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12199202500
12199202500 is an abundant number, since it is smaller than the sum of its proper divisors (15057952887).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12199202500 is an frugal number, since it uses more digits than its factorization.
12199202500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212 (or 54 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 31.
The spelling of 12199202500 in words is "twelve billion, one hundred ninety-nine million, two hundred two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •