Base | Representation |
---|---|
bin | 1011101100000011110… |
… | …01011110001010011101 |
3 | 1102101121222111010200120 |
4 | 11312001321132022131 |
5 | 23034444442111044 |
6 | 504255255345153 |
7 | 41005205412234 |
oct | 5660171361235 |
9 | 1371558433616 |
10 | 401611285149 |
11 | 145360111818 |
12 | 65a029821b9 |
13 | 2bb443c58c9 |
14 | 1561c193b1b |
15 | a6a80c6519 |
hex | 5d81e5e29d |
401611285149 has 4 divisors (see below), whose sum is σ = 535481713536. Its totient is φ = 267740856764.
The previous prime is 401611285081. The next prime is 401611285151. The reversal of 401611285149 is 941582116104.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 401611285149 - 27 = 401611285021 is a prime.
It is a super-2 number, since 2×4016112851492 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 401611285149.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401611285169) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66935214189 + ... + 66935214194.
It is an arithmetic number, because the mean of its divisors is an integer number (133870428384).
Almost surely, 2401611285149 is an apocalyptic number.
It is an amenable number.
401611285149 is a deficient number, since it is larger than the sum of its proper divisors (133870428387).
401611285149 is a wasteful number, since it uses less digits than its factorization.
401611285149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133870428386.
The product of its (nonzero) digits is 69120, while the sum is 42.
The spelling of 401611285149 in words is "four hundred one billion, six hundred eleven million, two hundred eighty-five thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •