Base | Representation |
---|---|
bin | 1011101101000011000… |
… | …10110000100011110101 |
3 | 1102102222222111111211101 |
4 | 11312201202300203311 |
5 | 23042041400431401 |
6 | 504424103010101 |
7 | 41024313214123 |
oct | 5664142604365 |
9 | 1372888444741 |
10 | 402142202101 |
11 | 145602875562 |
12 | 65b30739931 |
13 | 2bbca3b4153 |
14 | 1566c8b6913 |
15 | a6d99ea101 |
hex | 5da18b08f5 |
402142202101 has 16 divisors (see below), whose sum is σ = 432072241200. Its totient is φ = 374233711104.
The previous prime is 402142202089. The next prime is 402142202153. The reversal of 402142202101 is 101202241204.
It can be written as a sum of positive squares in 8 ways, for example, as 17898426225 + 384243775876 = 133785^2 + 619874^2 .
It is not a de Polignac number, because 402142202101 - 27 = 402142201973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402142202171) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 22590 + ... + 897103.
It is an arithmetic number, because the mean of its divisors is an integer number (27004515075).
Almost surely, 2402142202101 is an apocalyptic number.
It is an amenable number.
402142202101 is a deficient number, since it is larger than the sum of its proper divisors (29930039099).
402142202101 is an frugal number, since it uses more digits than its factorization.
402142202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919833 (or 919799 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 402142202101 its reverse (101202241204), we get a palindrome (503344443305).
The spelling of 402142202101 in words is "four hundred two billion, one hundred forty-two million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •