Base | Representation |
---|---|
bin | 101010011111111… |
… | …0101100100010111 |
3 | 10200101022100112221 |
4 | 1110333311210113 |
5 | 10410030130011 |
6 | 353300323211 |
7 | 50223655360 |
oct | 12477654427 |
9 | 3611270487 |
10 | 1426020631 |
11 | 671a51452 |
12 | 3396a3507 |
13 | 19958c3b9 |
14 | d7566b67 |
15 | 852d4971 |
hex | 54ff5917 |
1426020631 has 32 divisors (see below), whose sum is σ = 1749888000. Its totient is φ = 1135537920.
The previous prime is 1426020611. The next prime is 1426020637. The reversal of 1426020631 is 1360206241.
It is a cyclic number.
It is not a de Polignac number, because 1426020631 - 225 = 1392466199 is a prime.
It is a super-2 number, since 2×14260206312 = 4067069680075276322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1426020596 and 1426020605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1426020637) 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 31 ways as a sum of consecutive naturals, for example, 2303440 + ... + 2304058.
It is an arithmetic number, because the mean of its divisors is an integer number (54684000).
Almost surely, 21426020631 is an apocalyptic number.
1426020631 is a deficient number, since it is larger than the sum of its proper divisors (323867369).
1426020631 is a wasteful number, since it uses less digits than its factorization.
1426020631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1039.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 1426020631 is about 37762.6883444492. The cubic root of 1426020631 is about 1125.5771539944.
Adding to 1426020631 its reverse (1360206241), we get a palindrome (2786226872).
The spelling of 1426020631 in words is "one billion, four hundred twenty-six million, twenty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •