Base | Representation |
---|---|
bin | 10111110110010… |
… | …011110000110101 |
3 | 1000212212211102122 |
4 | 113312103300311 |
5 | 1304412101233 |
6 | 103411445325 |
7 | 12625621211 |
oct | 2766236065 |
9 | 1025784378 |
10 | 400112693 |
11 | 195942652 |
12 | b1bb6845 |
13 | 64b80996 |
14 | 3b1d3941 |
15 | 251d6d98 |
hex | 17d93c35 |
400112693 has 4 divisors (see below), whose sum is σ = 401860140. Its totient is φ = 398365248.
The previous prime is 400112653. The next prime is 400112707. The reversal of 400112693 is 396211004.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 257859364 + 142253329 = 16058^2 + 11927^2 .
It is a cyclic number.
It is not a de Polignac number, because 400112693 - 210 = 400111669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400112653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 873380 + ... + 873837.
It is an arithmetic number, because the mean of its divisors is an integer number (100465035).
Almost surely, 2400112693 is an apocalyptic number.
It is an amenable number.
400112693 is a deficient number, since it is larger than the sum of its proper divisors (1747447).
400112693 is a wasteful number, since it uses less digits than its factorization.
400112693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1747446.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 400112693 is about 20002.8171265949. The cubic root of 400112693 is about 736.8754873246.
Adding to 400112693 its reverse (396211004), we get a palindrome (796323697).
The spelling of 400112693 in words is "four hundred million, one hundred twelve thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •