Base | Representation |
---|---|
bin | 111101011110100110001011… |
… | …001110110001110100000001 |
3 | 1022110100101211212202011121211 |
4 | 331132212023032301310001 |
5 | 240414430211443422121 |
6 | 2355020231424450121 |
7 | 110644362003064324 |
oct | 7536461316616401 |
9 | 1273311755664554 |
10 | 270383412092161 |
11 | 79174a63277125 |
12 | 263aa149779941 |
13 | b7b407aac7024 |
14 | 4aaa8ac5a07bb |
15 | 213d45e057ce1 |
hex | f5e98b3b1d01 |
270383412092161 has 8 divisors (see below), whose sum is σ = 273270360780648. Its totient is φ = 267500578800000.
The previous prime is 270383412092149. The next prime is 270383412092201. The reversal of 270383412092161 is 161290214383072.
It can be written as a sum of positive squares in 4 ways, for example, as 48816251136 + 270334595841025 = 220944^2 + 16441855^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 270383412092161 - 227 = 270383277874433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (270383412099161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1028716980 + ... + 1028979781.
It is an arithmetic number, because the mean of its divisors is an integer number (34158795097581).
Almost surely, 2270383412092161 is an apocalyptic number.
It is an amenable number.
270383412092161 is a deficient number, since it is larger than the sum of its proper divisors (2886948688487).
270383412092161 is a wasteful number, since it uses less digits than its factorization.
270383412092161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2057698163.
The product of its (nonzero) digits is 870912, while the sum is 49.
The spelling of 270383412092161 in words is "two hundred seventy trillion, three hundred eighty-three billion, four hundred twelve million, ninety-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •