Base | Representation |
---|---|
bin | 1001001000001100… |
… | …0110000001010111 |
3 | 20022202122100121122 |
4 | 2102003012001113 |
5 | 20004233102011 |
6 | 1043050034155 |
7 | 114502034654 |
oct | 22203060127 |
9 | 6282570548 |
10 | 2450284631 |
11 | 1048138123 |
12 | 58471895b |
13 | 300843782 |
14 | 1935ccc2b |
15 | e51aa3db |
hex | 920c6057 |
2450284631 has 4 divisors (see below), whose sum is σ = 2579247000. Its totient is φ = 2321322264.
The previous prime is 2450284607. The next prime is 2450284663. The reversal of 2450284631 is 1364820542.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1364820542 = 2 ⋅682410271.
It is not a de Polignac number, because 2450284631 - 230 = 1376542807 is a prime.
It is a super-2 number, since 2×24502846312 = 12007789545829612322, 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 = 2450284591 and 2450284600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2450284531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64481156 + ... + 64481193.
It is an arithmetic number, because the mean of its divisors is an integer number (644811750).
Almost surely, 22450284631 is an apocalyptic number.
2450284631 is a deficient number, since it is larger than the sum of its proper divisors (128962369).
2450284631 is a wasteful number, since it uses less digits than its factorization.
2450284631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128962368.
The product of its (nonzero) digits is 46080, while the sum is 35.
The square root of 2450284631 is about 49500.3498068448. The cubic root of 2450284631 is about 1348.1519534419.
The spelling of 2450284631 in words is "two billion, four hundred fifty million, two hundred eighty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •