Base | Representation |
---|---|
bin | 1011100110101… |
… | …0011110100111 |
3 | 10101120201112222 |
4 | 2321222132213 |
5 | 44424430011 |
6 | 4455102555 |
7 | 1130456612 |
oct | 271523647 |
9 | 111521488 |
10 | 48670631 |
11 | 25522a69 |
12 | 14371a5b |
13 | a1112b9 |
14 | 666d179 |
15 | 4415ddb |
hex | 2e6a7a7 |
48670631 has 4 divisors (see below), whose sum is σ = 48684600. Its totient is φ = 48656664.
The previous prime is 48670579. The next prime is 48670639. The reversal of 48670631 is 13607684.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 48670631 - 218 = 48408487 is a prime.
It is a super-2 number, since 2×486706312 = 4737660643876322, 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 = 48670591 and 48670600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48670639) 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, 3005 + ... + 10313.
It is an arithmetic number, because the mean of its divisors is an integer number (12171150).
Almost surely, 248670631 is an apocalyptic number.
48670631 is a deficient number, since it is larger than the sum of its proper divisors (13969).
48670631 is an equidigital number, since it uses as much as digits as its factorization.
48670631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13968.
The product of its (nonzero) digits is 24192, while the sum is 35.
The square root of 48670631 is about 6976.4339744600. The cubic root of 48670631 is about 365.1088209963.
It can be divided in two parts, 486 and 70631, that added together give a palindrome (71117).
The spelling of 48670631 in words is "forty-eight million, six hundred seventy thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •