Base | Representation |
---|---|
bin | 10011101011001100110… |
… | …000101010100000000000 |
3 | 11210020220001002110202121 |
4 | 103223030300222200000 |
5 | 134123002042240000 |
6 | 2513043035454024 |
7 | 166453120134400 |
oct | 23531460524000 |
9 | 4706801073677 |
10 | 1352055040000 |
11 | 481448905205 |
12 | 19a0545b7314 |
13 | 9a662842962 |
14 | 49622bc0800 |
15 | 25283e00b1a |
hex | 13accc2a800 |
1352055040000 has 360 divisors, whose sum is σ = 3929961205170. Its totient is φ = 463540224000.
The previous prime is 1352055039971. The next prime is 1352055040027. The reversal of 1352055040000 is 405502531.
It can be written as a sum of positive squares in 5 ways, for example, as 20745217024 + 1331309822976 = 144032^2 + 1153824^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 62709222 + ... + 62730778.
Almost surely, 21352055040000 is an apocalyptic number.
1352055040000 is a gapful number since it is divisible by the number (10) 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 1352055040000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1964980602585).
1352055040000 is an abundant number, since it is smaller than the sum of its proper divisors (2577906165170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1352055040000 is an frugal number, since it uses more digits than its factorization.
1352055040000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21613 (or 21571 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 25.
The spelling of 1352055040000 in words is "one trillion, three hundred fifty-two billion, fifty-five million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •