Base | Representation |
---|---|
bin | 111111011110110… |
… | …0110001111010111 |
3 | 12111110010002211002 |
4 | 1332331212033113 |
5 | 13330244423011 |
6 | 551210533515 |
7 | 103533231644 |
oct | 17675461727 |
9 | 5443102732 |
10 | 2130076631 |
11 | 9a3411111 |
12 | 4b543729b |
13 | 27c3bb997 |
14 | 162c78dcb |
15 | c7008c3b |
hex | 7ef663d7 |
2130076631 has 8 divisors (see below), whose sum is σ = 2140311264. Its totient is φ = 2119864320.
The previous prime is 2130076607. The next prime is 2130076661. The reversal of 2130076631 is 1366700312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2130076631 - 222 = 2125882327 is a prime.
It is a super-2 number, since 2×21300766312 = 9074452907864620322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2130076594 and 2130076603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2130076661) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 204215 + ... + 214391.
It is an arithmetic number, because the mean of its divisors is an integer number (267538908).
Almost surely, 22130076631 is an apocalyptic number.
2130076631 is a deficient number, since it is larger than the sum of its proper divisors (10234633).
2130076631 is a wasteful number, since it uses less digits than its factorization.
2130076631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11161.
The product of its (nonzero) digits is 4536, while the sum is 29.
The square root of 2130076631 is about 46152.7532331496. The cubic root of 2130076631 is about 1286.6637809526.
Adding to 2130076631 its reverse (1366700312), we get a palindrome (3496776943).
The spelling of 2130076631 in words is "two billion, one hundred thirty million, seventy-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •