Base | Representation |
---|---|
bin | 1011101010010000000… |
… | …10101001101111110001 |
3 | 1102022010022222220022121 |
4 | 11311020002221233301 |
5 | 23031002444111421 |
6 | 504015102434241 |
7 | 40642151011312 |
oct | 5651002515761 |
9 | 1368108886277 |
10 | 400640613361 |
11 | 144a021aa72a |
12 | 65791892981 |
13 | 2ba1b2869c1 |
14 | 155692bc609 |
15 | a64cc89d41 |
hex | 5d480a9bf1 |
400640613361 has 4 divisors (see below), whose sum is σ = 400686678000. Its totient is φ = 400594548724.
The previous prime is 400640613353. The next prime is 400640613371. The reversal of 400640613361 is 163316046004.
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 400640613361 - 23 = 400640613353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (400640613301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23019271 + ... + 23036668.
It is an arithmetic number, because the mean of its divisors is an integer number (100171669500).
Almost surely, 2400640613361 is an apocalyptic number.
It is an amenable number.
400640613361 is a deficient number, since it is larger than the sum of its proper divisors (46064639).
400640613361 is an equidigital number, since it uses as much as digits as its factorization.
400640613361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46064638.
The product of its (nonzero) digits is 31104, while the sum is 34.
Adding to 400640613361 its reverse (163316046004), we get a palindrome (563956659365).
The spelling of 400640613361 in words is "four hundred billion, six hundred forty million, six hundred thirteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •