Base | Representation |
---|---|
bin | 111000100010011100000… |
… | …011001111100000000000 |
3 | 111202102120001012012112220 |
4 | 320202130003033200000 |
5 | 1002124012220444300 |
6 | 12132511232251040 |
7 | 550462401421020 |
oct | 70423403174000 |
9 | 14672501165486 |
10 | 3885268531200 |
11 | 1268807884a71 |
12 | 528ba86a0a80 |
13 | 2224c12a0364 |
14 | d60959d9a80 |
15 | 6b0e8800da0 |
hex | 3889c0cf800 |
3885268531200 has 1152 divisors, whose sum is σ = 15214226227200. Its totient is φ = 856141332480.
The previous prime is 3885268531147. The next prime is 3885268531247. The reversal of 3885268531200 is 21358625883.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5052364416 + ... + 5052365184.
It is an arithmetic number, because the mean of its divisors is an integer number (13206793600).
Almost surely, 23885268531200 is an apocalyptic number.
3885268531200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3885268531200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7607113113600).
3885268531200 is an abundant number, since it is smaller than the sum of its proper divisors (11328957696000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3885268531200 is a wasteful number, since it uses less digits than its factorization.
3885268531200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975 (or 950 counting only the distinct ones).
The product of its (nonzero) digits is 2764800, while the sum is 51.
The spelling of 3885268531200 in words is "three trillion, eight hundred eighty-five billion, two hundred sixty-eight million, five hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •