Base | Representation |
---|---|
bin | 1011101011001010100… |
… | …01011101001010000101 |
3 | 1102100101111210210220010 |
4 | 11311211101131022011 |
5 | 23033004021030341 |
6 | 504135502100433 |
7 | 40660254344652 |
oct | 5654521351205 |
9 | 1370344723803 |
10 | 401131033221 |
11 | 1451340133a6 |
12 | 658a9b7a719 |
13 | 2ba98a66379 |
14 | 155b449cc29 |
15 | a67ad5e716 |
hex | 5d6545d285 |
401131033221 has 8 divisors (see below), whose sum is σ = 534845094784. Its totient is φ = 267418830240.
The previous prime is 401131033211. The next prime is 401131033223. The reversal of 401131033221 is 122330131104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 401131033221 - 217 = 401130902149 is a prime.
It is a super-2 number, since 2×4011310332212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401131033223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 158241 + ... + 909561.
It is an arithmetic number, because the mean of its divisors is an integer number (66855636848).
Almost surely, 2401131033221 is an apocalyptic number.
It is an amenable number.
401131033221 is a deficient number, since it is larger than the sum of its proper divisors (133714061563).
401131033221 is a wasteful number, since it uses less digits than its factorization.
401131033221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929291.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 401131033221 its reverse (122330131104), we get a palindrome (523461164325).
The spelling of 401131033221 in words is "four hundred one billion, one hundred thirty-one million, thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •