Base | Representation |
---|---|
bin | 1011110000101101111… |
… | …1000000011101011000 |
3 | 201022112122021110012011 |
4 | 2330023133000131120 |
5 | 11302302333000012 |
6 | 232453500155304 |
7 | 20412065600053 |
oct | 2741337003530 |
9 | 638478243164 |
10 | 202056140632 |
11 | 78767473085 |
12 | 331b0238b34 |
13 | 160912c1938 |
14 | 9acb1d1a9a |
15 | 53c8c261a7 |
hex | 2f0b7c0758 |
202056140632 has 32 divisors (see below), whose sum is σ = 388345557600. Its totient is φ = 98500499200.
The previous prime is 202056140543. The next prime is 202056140641. The reversal of 202056140632 is 236041650202.
202056140632 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2020561406322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202056140594 and 202056140603.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 313782 + ... + 708922.
It is an arithmetic number, because the mean of its divisors is an integer number (12135798675).
Almost surely, 2202056140632 is an apocalyptic number.
It is an amenable number.
202056140632 is a deficient number, since it is larger than the sum of its proper divisors (186289416968).
202056140632 is a wasteful number, since it uses less digits than its factorization.
202056140632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396747 (or 396743 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 202056140632 its reverse (236041650202), we get a palindrome (438097790834).
The spelling of 202056140632 in words is "two hundred two billion, fifty-six million, one hundred forty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •