Base | Representation |
---|---|
bin | 1011100101110… |
… | …0011101101111 |
3 | 10101110210211001 |
4 | 2321130131233 |
5 | 44421110411 |
6 | 4453541131 |
7 | 1130130352 |
oct | 271343557 |
9 | 111423731 |
10 | 48613231 |
11 | 25493927 |
12 | 143447a7 |
13 | a0c1134 |
14 | 6656299 |
15 | 4403dc1 |
hex | 2e5c76f |
48613231 has 4 divisors (see below), whose sum is σ = 48715200. Its totient is φ = 48511264.
The previous prime is 48613211. The next prime is 48613241. The reversal of 48613231 is 13231684.
48613231 = 482 + 492 + ... + 5262.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 48613231 - 211 = 48611183 is a prime.
It is a super-2 number, since 2×486132312 = 4726492456518722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 48613231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48613211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50266 + ... + 51223.
It is an arithmetic number, because the mean of its divisors is an integer number (12178800).
Almost surely, 248613231 is an apocalyptic number.
48613231 is a deficient number, since it is larger than the sum of its proper divisors (101969).
48613231 is a wasteful number, since it uses less digits than its factorization.
48613231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101968.
The product of its digits is 3456, while the sum is 28.
The square root of 48613231 is about 6972.3189112375. The cubic root of 48613231 is about 364.9652334434.
The spelling of 48613231 in words is "forty-eight million, six hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •