Base | Representation |
---|---|
bin | 10101111111100110010001… |
… | …01111011111100110110000 |
3 | 20100020121202002001000112022 |
4 | 22333303020233133212300 |
5 | 22314401401102141014 |
6 | 250510234123251012 |
7 | 13121143225646162 |
oct | 1277631057374660 |
9 | 210217662030468 |
10 | 48364699646384 |
11 | 144573990a3540 |
12 | 55114a0079a68 |
13 | 20caa052b3544 |
14 | bd2c14988932 |
15 | 58d12446ba8e |
hex | 2bfcc8bdf9b0 |
48364699646384 has 80 divisors (see below), whose sum is σ = 104105246837760. Its totient is φ = 21581923418880.
The previous prime is 48364699646287. The next prime is 48364699646411.
48364699646384 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×483646996463842 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 48364699646299 and 48364699646308.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3544064 + ... + 10454175.
It is an arithmetic number, because the mean of its divisors is an integer number (1301315585472).
Almost surely, 248364699646384 is an apocalyptic number.
48364699646384 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
48364699646384 is an abundant number, since it is smaller than the sum of its proper divisors (55740547191376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48364699646384 is a wasteful number, since it uses less digits than its factorization.
48364699646384 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13998618 (or 13998612 counting only the distinct ones).
The product of its digits is 15479341056, while the sum is 80.
The spelling of 48364699646384 in words is "forty-eight trillion, three hundred sixty-four billion, six hundred ninety-nine million, six hundred forty-six thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •