Base | Representation |
---|---|
bin | 101101001100110001… |
… | …110001011110010001 |
3 | 11122021022221110202011 |
4 | 231030301301132101 |
5 | 1243343341200434 |
6 | 34143505222521 |
7 | 3335454423346 |
oct | 551461613621 |
9 | 148238843664 |
10 | 48532756369 |
11 | 19645526209 |
12 | 94a5631a41 |
13 | 4765aa9226 |
14 | 24c59167cd |
15 | 13e0b6ae64 |
hex | b4cc71791 |
48532756369 has 8 divisors (see below), whose sum is σ = 49514063040. Its totient is φ = 47556740400.
The previous prime is 48532756351. The next prime is 48532756373. The reversal of 48532756369 is 96365723584.
48532756369 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48532756369 - 29 = 48532755857 is a prime.
It is a super-2 number, since 2×485327563692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48532756319) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1304142 + ... + 1340839.
It is an arithmetic number, because the mean of its divisors is an integer number (6189257880).
Almost surely, 248532756369 is an apocalyptic number.
It is an amenable number.
48532756369 is a deficient number, since it is larger than the sum of its proper divisors (981306671).
48532756369 is a wasteful number, since it uses less digits than its factorization.
48532756369 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2645351.
The product of its digits is 32659200, while the sum is 58.
It can be divided in two parts, 485327 and 56369, that added together give a square (541696 = 7362).
The spelling of 48532756369 in words is "forty-eight billion, five hundred thirty-two million, seven hundred fifty-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •