Base | Representation |
---|---|
bin | 101001110000011… |
… | …1000110011110111 |
3 | 10121122110210100021 |
4 | 1103200320303313 |
5 | 10332142131411 |
6 | 351011030011 |
7 | 46502260534 |
oct | 12340706367 |
9 | 3548423307 |
10 | 1401130231 |
11 | 6599a0976 |
12 | 33129b307 |
13 | 194386057 |
14 | d4127d8b |
15 | 83019a71 |
hex | 53838cf7 |
1401130231 has 4 divisors (see below), whose sum is σ = 1408871464. Its totient is φ = 1393389000.
The previous prime is 1401130217. The next prime is 1401130249. The reversal of 1401130231 is 1320311041.
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 1401130231 - 225 = 1367575799 is a prime.
It is a super-2 number, since 2×14011302312 = 3926331848444226722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401130271) 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, 3870345 + ... + 3870706.
It is an arithmetic number, because the mean of its divisors is an integer number (352217866).
Almost surely, 21401130231 is an apocalyptic number.
1401130231 is a deficient number, since it is larger than the sum of its proper divisors (7741233).
1401130231 is an equidigital number, since it uses as much as digits as its factorization.
1401130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7741232.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1401130231 is about 37431.6741677419. The cubic root of 1401130231 is about 1118.9899032307.
Adding to 1401130231 its reverse (1320311041), we get a palindrome (2721441272).
The spelling of 1401130231 in words is "one billion, four hundred one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •