Base | Representation |
---|---|
bin | 111111111010000… |
… | …0101111101011011 |
3 | 12112102222220010002 |
4 | 1333310011331123 |
5 | 13342424043311 |
6 | 552441043215 |
7 | 104065531136 |
oct | 17764057533 |
9 | 5472886102 |
10 | 2144362331 |
11 | a00489181 |
12 | 4ba18650b |
13 | 282351167 |
14 | 164b1721d |
15 | c83cb93b |
hex | 7fd05f5b |
2144362331 has 4 divisors (see below), whose sum is σ = 2157202992. Its totient is φ = 2131521672.
The previous prime is 2144362327. The next prime is 2144362379. The reversal of 2144362331 is 1332634412.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2144362331 - 22 = 2144362327 is a prime.
It is a super-2 number, since 2×21443623312 = 9196579613223507122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2144362294 and 2144362303.
It is not an unprimeable number, because it can be changed into a prime (2144322331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6420080 + ... + 6420413.
It is an arithmetic number, because the mean of its divisors is an integer number (539300748).
Almost surely, 22144362331 is an apocalyptic number.
2144362331 is a deficient number, since it is larger than the sum of its proper divisors (12840661).
2144362331 is a wasteful number, since it uses less digits than its factorization.
2144362331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12840660.
The product of its digits is 10368, while the sum is 29.
The square root of 2144362331 is about 46307.2600247521. The cubic root of 2144362331 is about 1289.5337800040.
Adding to 2144362331 its reverse (1332634412), we get a palindrome (3476996743).
The spelling of 2144362331 in words is "two billion, one hundred forty-four million, three hundred sixty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •