Base | Representation |
---|---|
bin | 1011101011001010101… |
… | …01111111101010011011 |
3 | 1102100101121001021010212 |
4 | 11311211111333222123 |
5 | 23033004322120011 |
6 | 504135543401335 |
7 | 40660300432043 |
oct | 5654525775233 |
9 | 1370347037125 |
10 | 401132223131 |
11 | 1451347563a2 |
12 | 658aa45324b |
13 | 2ba99091b63 |
14 | 155b46cc723 |
15 | a67aee708b |
hex | 5d6557fa9b |
401132223131 has 4 divisors (see below), whose sum is σ = 401555806152. Its totient is φ = 400708640112.
The previous prime is 401132223059. The next prime is 401132223181. The reversal of 401132223131 is 131322231104.
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 401132223131 - 226 = 401065114267 is a prime.
It is a super-2 number, since 2×4011322231312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401132223097 and 401132223106.
It is not an unprimeable number, because it can be changed into a prime (401132223181) 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, 211790090 + ... + 211791983.
It is an arithmetic number, because the mean of its divisors is an integer number (100388951538).
Almost surely, 2401132223131 is an apocalyptic number.
401132223131 is a deficient number, since it is larger than the sum of its proper divisors (423583021).
401132223131 is an equidigital number, since it uses as much as digits as its factorization.
401132223131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423583020.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 401132223131 its reverse (131322231104), we get a palindrome (532454454235).
The spelling of 401132223131 in words is "four hundred one billion, one hundred thirty-two million, two hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •