Base | Representation |
---|---|
bin | 1000111101101010… |
… | …00100110000100100 |
3 | 110102100222221010211 |
4 | 10132311010300210 |
5 | 34323410300100 |
6 | 2113302025204 |
7 | 230151666400 |
oct | 43665046044 |
9 | 13370887124 |
10 | 4812196900 |
11 | 204a3a5835 |
12 | b23718204 |
13 | 5b8c850b4 |
14 | 339176100 |
15 | 1d270b1ba |
hex | 11ed44c24 |
4812196900 has 81 divisors (see below), whose sum is σ = 12159629937. Its totient is φ = 1648231200.
The previous prime is 4812196871. The next prime is 4812196901. The reversal of 4812196900 is 96912184.
The square root of 4812196900 is 69370.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1732390884 + 3079806016 = 41622^2 + 55496^2 .
It is a super-2 number, since 2×48121969002 = 46314478008739220000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4812196901) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4855405 + ... + 4856395.
Almost surely, 24812196900 is an apocalyptic number.
4812196900 is the 69370-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4812196900
4812196900 is an abundant number, since it is smaller than the sum of its proper divisors (7347433037).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4812196900 is an equidigital number, since it uses as much as digits as its factorization.
4812196900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2010 (or 1005 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 40.
The cubic root of 4812196900 is about 1688.2929087662.
The spelling of 4812196900 in words is "four billion, eight hundred twelve million, one hundred ninety-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •