Base | Representation |
---|---|
bin | 100111101101110101011… |
… | …110111111010110101010 |
3 | 100122220201212222010021220 |
4 | 213231311132333112222 |
5 | 324204023433303200 |
6 | 5445451201242510 |
7 | 401116662125250 |
oct | 47556536772652 |
9 | 10586655863256 |
10 | 2729275291050 |
11 | 96252a8279a0 |
12 | 380b50933436 |
13 | 16a4a5bb5429 |
14 | 96151c725d0 |
15 | 4aedc25a4a0 |
hex | 27b757bf5aa |
2729275291050 has 384 divisors, whose sum is σ = 8891113789440. Its totient is φ = 536778316800.
The previous prime is 2729275291033. The next prime is 2729275291079. The reversal of 2729275291050 is 501925729272.
It is a super-2 number, since 2×27292752910502 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2729275290984 and 2729275291002.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 266187724 + ... + 266197976.
It is an arithmetic number, because the mean of its divisors is an integer number (23153942160).
Almost surely, 22729275291050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2729275291050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4445556894720).
2729275291050 is an abundant number, since it is smaller than the sum of its proper divisors (6161838498390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2729275291050 is a wasteful number, since it uses less digits than its factorization.
2729275291050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11518 (or 11513 counting only the distinct ones).
The product of its (nonzero) digits is 1587600, while the sum is 51.
The spelling of 2729275291050 in words is "two trillion, seven hundred twenty-nine billion, two hundred seventy-five million, two hundred ninety-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •