Base | Representation |
---|---|
bin | 111000011000101110110… |
… | …010110111011001000101 |
3 | 111201102122122120210002000 |
4 | 320120232302313121011 |
5 | 1001441140432241023 |
6 | 12124025100335513 |
7 | 546643200023442 |
oct | 70305662673105 |
9 | 14642578523060 |
10 | 3874845587013 |
11 | 1264349353805 |
12 | 526b79b44599 |
13 | 22151ca9a06b |
14 | d578761c9c9 |
15 | 6abd874b243 |
hex | 3862ecb7645 |
3874845587013 has 16 divisors (see below), whose sum is σ = 5794161629760. Its totient is φ = 2559088049328.
The previous prime is 3874845586981. The next prime is 3874845587027. The reversal of 3874845587013 is 3107855484783.
It is a happy number.
3874845587013 is a `hidden beast` number, since 3 + 8 + 7 + 4 + 8 + 4 + 558 + 70 + 1 + 3 = 666.
3874845587013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3874845587013 - 25 = 3874845586981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3874845587033) 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, 670617670 + ... + 670623447.
It is an arithmetic number, because the mean of its divisors is an integer number (362135101860).
Almost surely, 23874845587013 is an apocalyptic number.
It is an amenable number.
3874845587013 is a deficient number, since it is larger than the sum of its proper divisors (1919316042747).
3874845587013 is a wasteful number, since it uses less digits than its factorization.
3874845587013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1341241233 (or 1341241227 counting only the distinct ones).
The product of its (nonzero) digits is 90316800, while the sum is 63.
The spelling of 3874845587013 in words is "three trillion, eight hundred seventy-four billion, eight hundred forty-five million, five hundred eighty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •