Base | Representation |
---|---|
bin | 1000011101001111… |
… | …1001101011111101 |
3 | 12212012200010021000 |
4 | 2013103321223331 |
5 | 14122124004211 |
6 | 1013133000513 |
7 | 110153611260 |
oct | 20723715375 |
9 | 5765603230 |
10 | 2270141181 |
11 | a65487740 |
12 | 534323139 |
13 | 2a241c509 |
14 | 1776d8cd7 |
15 | d4474656 |
hex | 874f9afd |
2270141181 has 32 divisors (see below), whose sum is σ = 4193049600. Its totient is φ = 1179293040.
The previous prime is 2270141173. The next prime is 2270141213. The reversal of 2270141181 is 1811410722.
It is not a de Polignac number, because 2270141181 - 23 = 2270141173 is a prime.
It is a super-2 number, since 2×22701411812 = 10307081963344149522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2270141381) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 543891 + ... + 548048.
It is an arithmetic number, because the mean of its divisors is an integer number (131032800).
Almost surely, 22270141181 is an apocalyptic number.
2270141181 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2270141181 is a deficient number, since it is larger than the sum of its proper divisors (1922908419).
2270141181 is a wasteful number, since it uses less digits than its factorization.
2270141181 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1091966 (or 1091960 counting only the distinct ones).
The product of its (nonzero) digits is 896, while the sum is 27.
The square root of 2270141181 is about 47645.9985833018. The cubic root of 2270141181 is about 1314.2690750228.
The spelling of 2270141181 in words is "two billion, two hundred seventy million, one hundred forty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •