Base | Representation |
---|---|
bin | 101000001110111… |
… | …0110111000000111 |
3 | 10111002021022122201 |
4 | 1100131312320013 |
5 | 10231100113411 |
6 | 341543135331 |
7 | 45311563252 |
oct | 12035667007 |
9 | 3432238581 |
10 | 1350004231 |
11 | 633051184 |
12 | 318144547 |
13 | 1868c5294 |
14 | cb41a099 |
15 | 7d7bb3c1 |
hex | 50776e07 |
1350004231 has 4 divisors (see below), whose sum is σ = 1352281392. Its totient is φ = 1347727072.
The previous prime is 1350004223. The next prime is 1350004241. The reversal of 1350004231 is 1324000531.
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 1350004231 - 23 = 1350004223 is a prime.
It is a super-2 number, since 2×13500042312 = 3645022847435802722, 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 = 1350004199 and 1350004208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350004241) 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, 1137691 + ... + 1138876.
It is an arithmetic number, because the mean of its divisors is an integer number (338070348).
Almost surely, 21350004231 is an apocalyptic number.
1350004231 is a deficient number, since it is larger than the sum of its proper divisors (2277161).
1350004231 is an equidigital number, since it uses as much as digits as its factorization.
1350004231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2277160.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 1350004231 is about 36742.4037183198. The cubic root of 1350004231 is about 1105.2106041937.
Adding to 1350004231 its reverse (1324000531), we get a palindrome (2674004762).
The spelling of 1350004231 in words is "one billion, three hundred fifty million, four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •