Base | Representation |
---|---|
bin | 1011101101000011010… |
… | …11010011001101111011 |
3 | 1102110000010201021022101 |
4 | 11312201223103031323 |
5 | 23042042434104321 |
6 | 504424223004231 |
7 | 41024341231132 |
oct | 5664153231573 |
9 | 1373003637271 |
10 | 402144441211 |
11 | 145604064867 |
12 | 65b31439677 |
13 | 2bbca9b9376 |
14 | 1566ccda919 |
15 | a6d9cdd791 |
hex | 5da1ad337b |
402144441211 has 4 divisors (see below), whose sum is σ = 402602987632. Its totient is φ = 401685894792.
The previous prime is 402144441131. The next prime is 402144441221. The reversal of 402144441211 is 112144441204.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 402144441211 - 29 = 402144440699 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 402144441211.
It is not an unprimeable number, because it can be changed into a prime (402144441221) 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, 229271895 + ... + 229273648.
It is an arithmetic number, because the mean of its divisors is an integer number (100650746908).
Almost surely, 2402144441211 is an apocalyptic number.
402144441211 is a deficient number, since it is larger than the sum of its proper divisors (458546421).
402144441211 is an equidigital number, since it uses as much as digits as its factorization.
402144441211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458546420.
The product of its (nonzero) digits is 4096, while the sum is 28.
Adding to 402144441211 its reverse (112144441204), we get a palindrome (514288882415).
The spelling of 402144441211 in words is "four hundred two billion, one hundred forty-four million, four hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •