Base | Representation |
---|---|
bin | 101110001101101010… |
… | …101101100111110111 |
3 | 11202002012110112211220 |
4 | 232031222231213313 |
5 | 1303111041042011 |
6 | 34443515201423 |
7 | 3404444102322 |
oct | 561552554767 |
9 | 152065415756 |
10 | 49621424631 |
11 | 1a054000849 |
12 | 974a146273 |
13 | 48aa4c012c |
14 | 258a3457b9 |
15 | 1456514506 |
hex | b8daad9f7 |
49621424631 has 8 divisors (see below), whose sum is σ = 66666952704. Its totient is φ = 32828423160.
The previous prime is 49621424623. The next prime is 49621424653. The reversal of 49621424631 is 13642412694.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 49621424631 - 23 = 49621424623 is a prime.
It is a super-2 number, since 2×496214246312 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49621424431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63131191 + ... + 63131976.
It is an arithmetic number, because the mean of its divisors is an integer number (8333369088).
Almost surely, 249621424631 is an apocalyptic number.
49621424631 is a deficient number, since it is larger than the sum of its proper divisors (17045528073).
49621424631 is a wasteful number, since it uses less digits than its factorization.
49621424631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126263301.
The product of its digits is 248832, while the sum is 42.
The spelling of 49621424631 in words is "forty-nine billion, six hundred twenty-one million, four hundred twenty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •