Base | Representation |
---|---|
bin | 1111101110010111101… |
… | …1101001111100001110 |
3 | 221211021220121000120010 |
4 | 3323211323221330032 |
5 | 13411224232434402 |
6 | 324034141334050 |
7 | 25342313440230 |
oct | 3734573517416 |
9 | 854256530503 |
10 | 270145593102 |
11 | a4628165550 |
12 | 44433267326 |
13 | 1c622981898 |
14 | d10a196250 |
15 | 7061743a6c |
hex | 3ee5ee9f0e |
270145593102 has 128 divisors (see below), whose sum is σ = 692163698688. Its totient is φ = 68236905600.
The previous prime is 270145593077. The next prime is 270145593161. The reversal of 270145593102 is 201395541072.
270145593102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 66032077 + ... + 66036167.
It is an arithmetic number, because the mean of its divisors is an integer number (5407528896).
Almost surely, 2270145593102 is an apocalyptic number.
270145593102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 270145593102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (346081849344).
270145593102 is an abundant number, since it is smaller than the sum of its proper divisors (422018105586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270145593102 is a wasteful number, since it uses less digits than its factorization.
270145593102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8014.
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 270145593102 in words is "two hundred seventy billion, one hundred forty-five million, five hundred ninety-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •