Base | Representation |
---|---|
bin | 1011101011000110111… |
… | …10111011100000111001 |
3 | 1102100022102022112011001 |
4 | 11311203132323200321 |
5 | 23032423324323001 |
6 | 504132510405001 |
7 | 40656441224425 |
oct | 5654336734071 |
9 | 1370272275131 |
10 | 401101011001 |
11 | 145119078249 |
12 | 6589bb00761 |
13 | 2ba92784242 |
14 | 155b04c5b85 |
15 | a6783ce001 |
hex | 5d637bb839 |
401101011001 has 8 divisors (see below), whose sum is σ = 404828483400. Its totient is φ = 397374405120.
The previous prime is 401101010969. The next prime is 401101011029. The reversal of 401101011001 is 100110101104.
It can be written as a sum of positive squares in 4 ways, for example, as 117758785600 + 283342225401 = 343160^2 + 532299^2 .
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 401101011001 - 25 = 401101010969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401101011061) 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 7 ways as a sum of consecutive naturals, for example, 732681 + ... + 1157161.
It is an arithmetic number, because the mean of its divisors is an integer number (50603560425).
Almost surely, 2401101011001 is an apocalyptic number.
It is an amenable number.
401101011001 is a deficient number, since it is larger than the sum of its proper divisors (3727472399).
401101011001 is a wasteful number, since it uses less digits than its factorization.
401101011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433259.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 401101011001 its reverse (100110101104), we get a palindrome (501211112105).
The spelling of 401101011001 in words is "four hundred one billion, one hundred one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.438 sec. • engine limits •