Base | Representation |
---|---|
bin | 1011101101100110111… |
… | …11010111100011100101 |
3 | 1102110202222002000210202 |
4 | 11312303133113203211 |
5 | 23043200441200031 |
6 | 504514020400245 |
7 | 41034630430535 |
oct | 5666337274345 |
9 | 1373688060722 |
10 | 402443303141 |
11 | 1457478311a0 |
12 | 65bb5546085 |
13 | 2bc478a9149 |
14 | 1569a8954c5 |
15 | a7061752cb |
hex | 5db37d78e5 |
402443303141 has 8 divisors (see below), whose sum is σ = 440913305664. Its totient is φ = 364287341920.
The previous prime is 402443303131. The next prime is 402443303159. The reversal of 402443303141 is 141303344204.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 402443303141 - 210 = 402443302117 is a prime.
It is a super-2 number, since 2×4024433031412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402443303111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78507641 + ... + 78512766.
It is an arithmetic number, because the mean of its divisors is an integer number (55114163208).
Almost surely, 2402443303141 is an apocalyptic number.
It is an amenable number.
402443303141 is a deficient number, since it is larger than the sum of its proper divisors (38470002523).
402443303141 is a wasteful number, since it uses less digits than its factorization.
402443303141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157020651.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 402443303141 its reverse (141303344204), we get a palindrome (543746647345).
The spelling of 402443303141 in words is "four hundred two billion, four hundred forty-three million, three hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •