Base | Representation |
---|---|
bin | 1011101011010101001… |
… | …01110011001100100101 |
3 | 1102100121201200121200010 |
4 | 11311222211303030211 |
5 | 23033144341034303 |
6 | 504152410240433 |
7 | 40662416606226 |
oct | 5655245631445 |
9 | 1370551617603 |
10 | 401220252453 |
11 | 14517a4110a9 |
12 | 65913a26119 |
13 | 2bab13a3b07 |
14 | 155c228524d |
15 | a683ad4c03 |
hex | 5d6a973325 |
401220252453 has 4 divisors (see below), whose sum is σ = 534960336608. Its totient is φ = 267480168300.
The previous prime is 401220252449. The next prime is 401220252541. The reversal of 401220252453 is 354252022104.
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 not a de Polignac number, because 401220252453 - 22 = 401220252449 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 401220252453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401220242453) 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, 66870042073 + ... + 66870042078.
It is an arithmetic number, because the mean of its divisors is an integer number (133740084152).
Almost surely, 2401220252453 is an apocalyptic number.
It is an amenable number.
401220252453 is a deficient number, since it is larger than the sum of its proper divisors (133740084155).
401220252453 is a wasteful number, since it uses less digits than its factorization.
401220252453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133740084154.
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 401220252453 its reverse (354252022104), we get a palindrome (755472274557).
The spelling of 401220252453 in words is "four hundred one billion, two hundred twenty million, two hundred fifty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •