Base | Representation |
---|---|
bin | 101010111011000… |
… | …0011011010101011 |
3 | 10201101001102102211 |
4 | 1111312003122223 |
5 | 10422144430011 |
6 | 354525105551 |
7 | 50455531261 |
oct | 12566033253 |
9 | 3641042384 |
10 | 1440233131 |
11 | 679a79517 |
12 | 3423b82b7 |
13 | 19c4c746c |
14 | d93c6431 |
15 | 86690b21 |
hex | 55d836ab |
1440233131 has 4 divisors (see below), whose sum is σ = 1448558352. Its totient is φ = 1431907912.
The previous prime is 1440233107. The next prime is 1440233143. The reversal of 1440233131 is 1313320441.
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 1440233131 - 211 = 1440231083 is a prime.
It is a super-2 number, since 2×14402331312 = 4148542943260126322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1440233191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4162351 + ... + 4162696.
It is an arithmetic number, because the mean of its divisors is an integer number (362139588).
Almost surely, 21440233131 is an apocalyptic number.
1440233131 is a deficient number, since it is larger than the sum of its proper divisors (8325221).
1440233131 is an equidigital number, since it uses as much as digits as its factorization.
1440233131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8325220.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1440233131 is about 37950.4035683417. The cubic root of 1440233131 is about 1129.3041715551.
Adding to 1440233131 its reverse (1313320441), we get a palindrome (2753553572).
The spelling of 1440233131 in words is "one billion, four hundred forty million, two hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •