Base | Representation |
---|---|
bin | 1000000100001100… |
… | …0111000110011101 |
3 | 12120212222021110010 |
4 | 2001003013012131 |
5 | 13413224421011 |
6 | 554501033433 |
7 | 104436563016 |
oct | 20103070635 |
9 | 5525867403 |
10 | 2165076381 |
11 | a11146a26 |
12 | 5050b5879 |
13 | 2867245b0 |
14 | 16778a00d |
15 | ca11e1a6 |
hex | 810c719d |
2165076381 has 16 divisors (see below), whose sum is σ = 3184655040. Its totient is φ = 1299857280.
The previous prime is 2165076379. The next prime is 2165076521. The reversal of 2165076381 is 1836705612.
It is not a de Polignac number, because 2165076381 - 21 = 2165076379 is a prime.
It is a super-2 number, since 2×21650763812 = 9375111471128114322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2165076281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 675411 + ... + 678608.
It is an arithmetic number, because the mean of its divisors is an integer number (199040940).
Almost surely, 22165076381 is an apocalyptic number.
It is an amenable number.
2165076381 is a deficient number, since it is larger than the sum of its proper divisors (1019578659).
2165076381 is a wasteful number, since it uses less digits than its factorization.
2165076381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1354076.
The product of its (nonzero) digits is 60480, while the sum is 39.
The square root of 2165076381 is about 46530.3812685862. The cubic root of 2165076381 is about 1293.6726820512.
The spelling of 2165076381 in words is "two billion, one hundred sixty-five million, seventy-six thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •