Base | Representation |
---|---|
bin | 10110001000101011011100… |
… | …10001010000000000110000 |
3 | 20101100110002220210211012201 |
4 | 23010111232101100000300 |
5 | 22340004402340200420 |
6 | 251305435054032544 |
7 | 13152530234305432 |
oct | 1304255621200060 |
9 | 211313086724181 |
10 | 48676714381360 |
11 | 145677512a5a7a |
12 | 5561a591a8754 |
13 | 212126b335790 |
14 | c03d73662652 |
15 | 5962d680c10a |
hex | 2c456e450030 |
48676714381360 has 160 divisors (see below), whose sum is σ = 132049483917120. Its totient is φ = 16522320052224.
The previous prime is 48676714381333. The next prime is 48676714381367. The reversal of 48676714381360 is 6318341767684.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 48676714381292 and 48676714381301.
It is not an unprimeable number, because it can be changed into a prime (48676714381367) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31253805 + ... + 32774284.
It is an arithmetic number, because the mean of its divisors is an integer number (825309274482).
Almost surely, 248676714381360 is an apocalyptic number.
48676714381360 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
48676714381360 is an abundant number, since it is smaller than the sum of its proper divisors (83372769535760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48676714381360 is a wasteful number, since it uses less digits than its factorization.
48676714381360 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64028175 (or 64028169 counting only the distinct ones).
The product of its (nonzero) digits is 97542144, while the sum is 64.
The spelling of 48676714381360 in words is "forty-eight trillion, six hundred seventy-six billion, seven hundred fourteen million, three hundred eighty-one thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •