Base | Representation |
---|---|
bin | 1011101011111011101… |
… | …01011100110011001001 |
3 | 1102101110020020002120222 |
4 | 11311331311130303021 |
5 | 23034330014401441 |
6 | 504244422355425 |
7 | 41003420136221 |
oct | 5657565346311 |
9 | 1371406202528 |
10 | 401543122121 |
11 | 145325695939 |
12 | 659a3b8bb75 |
13 | 2bb3324b25b |
14 | 156130cd081 |
15 | a6a210ed4b |
hex | 5d7dd5ccc9 |
401543122121 has 4 divisors (see below), whose sum is σ = 401563353552. Its totient is φ = 401522890692.
The previous prime is 401543122073. The next prime is 401543122139. The reversal of 401543122121 is 121221345104.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-401543122121 is a prime.
It is a super-2 number, since 2×4015431221212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401543125121) 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, 10085915 + ... + 10125648.
It is an arithmetic number, because the mean of its divisors is an integer number (100390838388).
Almost surely, 2401543122121 is an apocalyptic number.
It is an amenable number.
401543122121 is a deficient number, since it is larger than the sum of its proper divisors (20231431).
401543122121 is a wasteful number, since it uses less digits than its factorization.
401543122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20231430.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 401543122121 its reverse (121221345104), we get a palindrome (522764467225).
The spelling of 401543122121 in words is "four hundred one billion, five hundred forty-three million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •