Base | Representation |
---|---|
bin | 1001011000110111… |
… | …1010101011100111 |
3 | 20111122020222111020 |
4 | 2112031322223213 |
5 | 20130134340011 |
6 | 1054025142223 |
7 | 116311415112 |
oct | 22615725347 |
9 | 6448228436 |
10 | 2520230631 |
11 | 1083671636 |
12 | 5a402a973 |
13 | 312193839 |
14 | 19c9d9579 |
15 | eb3c5006 |
hex | 9637aae7 |
2520230631 has 8 divisors (see below), whose sum is σ = 3376233984. Its totient is φ = 1672190520.
The previous prime is 2520230621. The next prime is 2520230633. The reversal of 2520230631 is 1360320252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2520230631 - 211 = 2520228583 is a prime.
It is a super-2 number, since 2×25202306312 = 12703124866861316322, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2520230633) 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 7 ways as a sum of consecutive naturals, for example, 1990071 + ... + 1991336.
It is an arithmetic number, because the mean of its divisors is an integer number (422029248).
Almost surely, 22520230631 is an apocalyptic number.
2520230631 is a deficient number, since it is larger than the sum of its proper divisors (856003353).
2520230631 is a wasteful number, since it uses less digits than its factorization.
2520230631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3981621.
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 2520230631 is about 50201.8986792332. The cubic root of 2520230631 is about 1360.8599360663.
Adding to 2520230631 its reverse (1360320252), we get a palindrome (3880550883).
The spelling of 2520230631 in words is "two billion, five hundred twenty million, two hundred thirty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •