Base | Representation |
---|---|
bin | 1011101010111100101… |
… | …00001100100100110101 |
3 | 1102100002101011201102002 |
4 | 11311132110030210311 |
5 | 23032234130424341 |
6 | 504120132225045 |
7 | 40654336255406 |
oct | 5653624144465 |
9 | 1370071151362 |
10 | 401014311221 |
11 | 145084140437 |
12 | 65876a6b185 |
13 | 2ba7a8194b4 |
14 | 155a2b979ad |
15 | a6709a529b |
hex | 5d5e50c935 |
401014311221 has 4 divisors (see below), whose sum is σ = 401016723744. Its totient is φ = 401011898700.
The previous prime is 401014311109. The next prime is 401014311223. The reversal of 401014311221 is 122113410104.
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 401014311221 - 234 = 383834442037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 401014311193 and 401014311202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401014311223) 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, 936875 + ... + 1296056.
It is an arithmetic number, because the mean of its divisors is an integer number (100254180936).
Almost surely, 2401014311221 is an apocalyptic number.
It is an amenable number.
401014311221 is a deficient number, since it is larger than the sum of its proper divisors (2412523).
401014311221 is a wasteful number, since it uses less digits than its factorization.
401014311221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2412522.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 401014311221 its reverse (122113410104), we get a palindrome (523127721325).
The spelling of 401014311221 in words is "four hundred one billion, fourteen million, three hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •