Base | Representation |
---|---|
bin | 110000111001110000110… |
… | …100111100110000100000 |
3 | 102220021012000112121220210 |
4 | 300321300310330300200 |
5 | 420024410140312031 |
6 | 11051452502534120 |
7 | 464535513125112 |
oct | 60716064746040 |
9 | 12807160477823 |
10 | 3360557354016 |
11 | 1086228020395 |
12 | 46336ba37340 |
13 | 1b4b8c702565 |
14 | b891a9333b2 |
15 | 5c63854c746 |
hex | 30e70d3cc20 |
3360557354016 has 192 divisors, whose sum is σ = 9271825145856. Its totient is φ = 1064417587200.
The previous prime is 3360557353999. The next prime is 3360557354041. The reversal of 3360557354016 is 6104537550633.
It is a super-2 number, since 2×33605573540162 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61983816 + ... + 62038008.
It is an arithmetic number, because the mean of its divisors is an integer number (48290755968).
Almost surely, 23360557354016 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3360557354016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4635912572928).
3360557354016 is an abundant number, since it is smaller than the sum of its proper divisors (5911267791840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3360557354016 is a wasteful number, since it uses less digits than its factorization.
3360557354016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54615 (or 54607 counting only the distinct ones).
The product of its (nonzero) digits is 3402000, while the sum is 48.
The spelling of 3360557354016 in words is "three trillion, three hundred sixty billion, five hundred fifty-seven million, three hundred fifty-four thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •