Base | Representation |
---|---|
bin | 1011101010000101010… |
… | …10111110111010010001 |
3 | 1102021220001110210220112 |
4 | 11311002222332322101 |
5 | 23030311413210023 |
6 | 504002123451105 |
7 | 40640005156631 |
oct | 5650252767221 |
9 | 1367801423815 |
10 | 400550522513 |
11 | 144966367089 |
12 | 65767686a95 |
13 | 2ba057025cb |
14 | 1555b34a6c1 |
15 | a644de1478 |
hex | 5d42abee91 |
400550522513 has 4 divisors (see below), whose sum is σ = 407339514480. Its totient is φ = 393761530548.
The previous prime is 400550522509. The next prime is 400550522539. The reversal of 400550522513 is 315225055004.
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 400550522513 - 22 = 400550522509 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 400550522513.
It is not an unprimeable number, because it can be changed into a prime (400550522573) 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, 3394495895 + ... + 3394496012.
It is an arithmetic number, because the mean of its divisors is an integer number (101834878620).
Almost surely, 2400550522513 is an apocalyptic number.
It is an amenable number.
400550522513 is a deficient number, since it is larger than the sum of its proper divisors (6788991967).
400550522513 is an equidigital number, since it uses as much as digits as its factorization.
400550522513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6788991966.
The product of its (nonzero) digits is 30000, while the sum is 32.
Adding to 400550522513 its reverse (315225055004), we get a palindrome (715775577517).
The spelling of 400550522513 in words is "four hundred billion, five hundred fifty million, five hundred twenty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •