Base | Representation |
---|---|
bin | 101001111011010… |
… | …0011110011011101 |
3 | 10122001011102101100 |
4 | 1103312203303131 |
5 | 10340120430412 |
6 | 351332503313 |
7 | 46601461560 |
oct | 12366436335 |
9 | 3561142340 |
10 | 1406811357 |
11 | 662121216 |
12 | 33317ab39 |
13 | 1955c4b73 |
14 | d4ba64d7 |
15 | 8378cedc |
hex | 53da3cdd |
1406811357 has 48 divisors (see below), whose sum is σ = 2450448000. Its totient is φ = 759756672.
The previous prime is 1406811347. The next prime is 1406811377. The reversal of 1406811357 is 7531186041.
It is not a de Polignac number, because 1406811357 - 26 = 1406811293 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1406811317) 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 47 ways as a sum of consecutive naturals, for example, 608119 + ... + 610427.
It is an arithmetic number, because the mean of its divisors is an integer number (51051000).
Almost surely, 21406811357 is an apocalyptic number.
It is an amenable number.
1406811357 is a deficient number, since it is larger than the sum of its proper divisors (1043636643).
1406811357 is a wasteful number, since it uses less digits than its factorization.
1406811357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2850 (or 2847 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 1406811357 is about 37507.4840131940. The cubic root of 1406811357 is about 1120.5002434249.
Adding to 1406811357 its reverse (7531186041), we get a palindrome (8937997398).
It can be divided in two parts, 14068 and 11357, that added together give a triangular number (25425 = T225).
The spelling of 1406811357 in words is "one billion, four hundred six million, eight hundred eleven thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •