Base | Representation |
---|---|
bin | 101001110000010… |
… | …1111100011111111 |
3 | 10121122101212101022 |
4 | 1103200233203333 |
5 | 10332134423401 |
6 | 351010134355 |
7 | 46502042231 |
oct | 12340574377 |
9 | 3548355338 |
10 | 1401092351 |
11 | 65997546a |
12 | 3312813bb |
13 | 194371a39 |
14 | d4118251 |
15 | 8300d71b |
hex | 5382f8ff |
1401092351 has 4 divisors (see below), whose sum is σ = 1407264792. Its totient is φ = 1394919912.
The previous prime is 1401092327. The next prime is 1401092353. The reversal of 1401092351 is 1532901041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1401092351 - 210 = 1401091327 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 1401092351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401092353) 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, 3085880 + ... + 3086333.
It is an arithmetic number, because the mean of its divisors is an integer number (351816198).
Almost surely, 21401092351 is an apocalyptic number.
1401092351 is a deficient number, since it is larger than the sum of its proper divisors (6172441).
1401092351 is an equidigital number, since it uses as much as digits as its factorization.
1401092351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6172440.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 1401092351 is about 37431.1681757329. The cubic root of 1401092351 is about 1118.9798190576.
Adding to 1401092351 its reverse (1532901041), we get a palindrome (2933993392).
The spelling of 1401092351 in words is "one billion, four hundred one million, ninety-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •