Base | Representation |
---|---|
bin | 11110101001100010110… |
… | …10001100100000000000 |
3 | 10201200020001210112201001 |
4 | 33110301122030200000 |
5 | 114223220030004143 |
6 | 2123441404421344 |
7 | 136040461531150 |
oct | 17246132144000 |
9 | 3650201715631 |
10 | 1053095938048 |
11 | 376685226030 |
12 | 15011b847854 |
13 | 783ca57076b |
14 | 38d81dd4760 |
15 | 1c5d7d0114d |
hex | f53168c800 |
1053095938048 has 192 divisors, whose sum is σ = 2636619672960. Its totient is φ = 408521932800.
The previous prime is 1053095938039. The next prime is 1053095938061. The reversal of 1053095938048 is 8408395903501.
It is a super-2 number, since 2×10530959380482 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1053095938048.
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, 36728838 + ... + 36757498.
It is an arithmetic number, because the mean of its divisors is an integer number (13732394130).
Almost surely, 21053095938048 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 1053095938048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1318309836480).
1053095938048 is an abundant number, since it is smaller than the sum of its proper divisors (1583523734912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053095938048 is a wasteful number, since it uses less digits than its factorization.
1053095938048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28934 (or 28914 counting only the distinct ones).
The product of its (nonzero) digits is 4665600, while the sum is 55.
The spelling of 1053095938048 in words is "one trillion, fifty-three billion, ninety-five million, nine hundred thirty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •