Base | Representation |
---|---|
bin | 1001111111010011… |
… | …0101001011000111 |
3 | 20220212120120211110 |
4 | 2133310311023013 |
5 | 20442421123011 |
6 | 1122024140103 |
7 | 123306515232 |
oct | 23764651307 |
9 | 6825516743 |
10 | 2681426631 |
11 | 1156660574 |
12 | 62a007633 |
13 | 3396b27a0 |
14 | 1b619a419 |
15 | 10a616ba6 |
hex | 9fd352c7 |
2681426631 has 32 divisors (see below), whose sum is σ = 3974181120. Its totient is φ = 1597837824.
The previous prime is 2681426617. The next prime is 2681426639. The reversal of 2681426631 is 1366241862.
It is not a de Polignac number, because 2681426631 - 26 = 2681426567 is a prime.
It is a super-2 number, since 2×26814266312 = 14380097554872020322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 2681426631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2681426639) 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, 145471 + ... + 162863.
It is an arithmetic number, because the mean of its divisors is an integer number (124193160).
Almost surely, 22681426631 is an apocalyptic number.
2681426631 is a deficient number, since it is larger than the sum of its proper divisors (1292754489).
2681426631 is a wasteful number, since it uses less digits than its factorization.
2681426631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17535.
The product of its digits is 82944, while the sum is 39.
The square root of 2681426631 is about 51782.4934799397. The cubic root of 2681426631 is about 1389.2763396676.
The spelling of 2681426631 in words is "two billion, six hundred eighty-one million, four hundred twenty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •