Base | Representation |
---|---|
bin | 1011110000111001000… |
… | …1110000110110000100 |
3 | 201022122220110011210001 |
4 | 2330032101300312010 |
5 | 11302401332003302 |
6 | 232502252411044 |
7 | 20413205105443 |
oct | 2741621606604 |
9 | 638586404701 |
10 | 202103000452 |
11 | 78790969601 |
12 | 33203a76a84 |
13 | 1609ac1a942 |
14 | 9ad350cd5a |
15 | 53ccdd0787 |
hex | 2f0e470d84 |
202103000452 has 6 divisors (see below), whose sum is σ = 353680250798. Its totient is φ = 101051500224.
The previous prime is 202103000419. The next prime is 202103000453. The reversal of 202103000452 is 254000301202.
202103000452 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 195376376196 + 6726624256 = 442014^2 + 82016^2 .
It is a super-2 number, since 2×2021030004522 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (202103000453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25262875053 + ... + 25262875060.
Almost surely, 2202103000452 is an apocalyptic number.
It is an amenable number.
202103000452 is a deficient number, since it is larger than the sum of its proper divisors (151577250346).
202103000452 is a wasteful number, since it uses less digits than its factorization.
202103000452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50525750117 (or 50525750115 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 19.
Adding to 202103000452 its reverse (254000301202), we get a palindrome (456103301654).
The spelling of 202103000452 in words is "two hundred two billion, one hundred three million, four hundred fifty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •