Base | Representation |
---|---|
bin | 110001010010011111110… |
… | …001110010000000101000 |
3 | 102222210201212011112110110 |
4 | 301102133301302000220 |
5 | 420443302400401423 |
6 | 11112004042214320 |
7 | 466465602150036 |
oct | 61223761620050 |
9 | 12883655145413 |
10 | 3387114856488 |
11 | 1096516042040 |
12 | 468541ab43a0 |
13 | 1b753281226c |
14 | b9d19aab556 |
15 | 5d18ed27193 |
hex | 3149fc72028 |
3387114856488 has 64 divisors (see below), whose sum is σ = 9237836160000. Its totient is φ = 1026370642880.
The previous prime is 3387114856483. The next prime is 3387114856501. The reversal of 3387114856488 is 8846584117833.
It is a super-2 number, since 2×33871148564882 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is not an unprimeable number, because it can be changed into a prime (3387114856483) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10934995 + ... + 11240477.
It is an arithmetic number, because the mean of its divisors is an integer number (144341190000).
Almost surely, 23387114856488 is an apocalyptic number.
It is an amenable number.
3387114856488 is an abundant number, since it is smaller than the sum of its proper divisors (5850721303512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3387114856488 is a wasteful number, since it uses less digits than its factorization.
3387114856488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347502 (or 347498 counting only the distinct ones).
The product of its digits is 123863040, while the sum is 66.
The spelling of 3387114856488 in words is "three trillion, three hundred eighty-seven billion, one hundred fourteen million, eight hundred fifty-six thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •