Base | Representation |
---|---|
bin | 101100110001100000… |
… | …110011111111011001 |
3 | 11121002110012120102110 |
4 | 230301200303333121 |
5 | 1241424240403101 |
6 | 34030245022533 |
7 | 3321231344355 |
oct | 546140637731 |
9 | 147073176373 |
10 | 48075325401 |
11 | 194302a4594 |
12 | 93983b4a49 |
13 | 46c20aa10c |
14 | 2480c82465 |
15 | 13b5910cd6 |
hex | b31833fd9 |
48075325401 has 4 divisors (see below), whose sum is σ = 64100433872. Its totient is φ = 32050216932.
The previous prime is 48075325393. The next prime is 48075325439. The reversal of 48075325401 is 10452357084.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 48075325401 - 23 = 48075325393 is a prime.
It is a super-3 number, since 3×480753254013 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 48075325401.
It is not an unprimeable number, because it can be changed into a prime (48075325471) 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, 8012554231 + ... + 8012554236.
It is an arithmetic number, because the mean of its divisors is an integer number (16025108468).
Almost surely, 248075325401 is an apocalyptic number.
It is an amenable number.
48075325401 is a deficient number, since it is larger than the sum of its proper divisors (16025108471).
48075325401 is a wasteful number, since it uses less digits than its factorization.
48075325401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16025108470.
The product of its (nonzero) digits is 134400, while the sum is 39.
The spelling of 48075325401 in words is "forty-eight billion, seventy-five million, three hundred twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •