Base | Representation |
---|---|
bin | 101100110000001100010… |
… | …000000111001101010000 |
3 | 101220000011001200120111210 |
4 | 230300030100013031100 |
5 | 400341410421244402 |
6 | 10312453100540120 |
7 | 435122221552422 |
oct | 54601420071520 |
9 | 11800131616453 |
10 | 3075402134352 |
11 | a862a8369299 |
12 | 418049b51640 |
13 | 194017214052 |
14 | a8bc916c812 |
15 | 54ee924206c |
hex | 2cc0c407350 |
3075402134352 has 160 divisors (see below), whose sum is σ = 8147872788480. Its totient is φ = 999264960000.
The previous prime is 3075402134263. The next prime is 3075402134393. The reversal of 3075402134352 is 2534312045703.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 3075402134352.
It is a congruent number.
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, 190549099 + ... + 190565237.
It is an arithmetic number, because the mean of its divisors is an integer number (50924204928).
Almost surely, 23075402134352 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 3075402134352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4073936394240).
3075402134352 is an abundant number, since it is smaller than the sum of its proper divisors (5072470654128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3075402134352 is a wasteful number, since it uses less digits than its factorization.
3075402134352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16793 (or 16787 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 39.
The spelling of 3075402134352 in words is "three trillion, seventy-five billion, four hundred two million, one hundred thirty-four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •