Base | Representation |
---|---|
bin | 1011101101100110110… |
… | …10111001101100010011 |
3 | 1102110202212212112122011 |
4 | 11312303122321230103 |
5 | 23043200141212433 |
6 | 504513535323351 |
7 | 41034614453044 |
oct | 5666332715423 |
9 | 1373685775564 |
10 | 402442132243 |
11 | 145747101508 |
12 | 65bb5080557 |
13 | 2bc475891c8 |
14 | 1569a66c8cb |
15 | a705ee33cd |
hex | 5db36b9b13 |
402442132243 has 4 divisors (see below), whose sum is σ = 403727890168. Its totient is φ = 401156374320.
The previous prime is 402442132237. The next prime is 402442132247. The reversal of 402442132243 is 342231244204.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-402442132243 is a prime.
It is a super-2 number, since 2×4024421322432 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (402442132247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 642878493 + ... + 642879118.
It is an arithmetic number, because the mean of its divisors is an integer number (100931972542).
Almost surely, 2402442132243 is an apocalyptic number.
402442132243 is a deficient number, since it is larger than the sum of its proper divisors (1285757925).
402442132243 is a wasteful number, since it uses less digits than its factorization.
402442132243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285757924.
The product of its (nonzero) digits is 36864, while the sum is 31.
Adding to 402442132243 its reverse (342231244204), we get a palindrome (744673376447).
The spelling of 402442132243 in words is "four hundred two billion, four hundred forty-two million, one hundred thirty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •