Base | Representation |
---|---|
bin | 100100101010000… |
… | …1110110001001101 |
3 | 10011201112111212021 |
4 | 1021110032301031 |
5 | 10004342241031 |
6 | 322020010141 |
7 | 42324111601 |
oct | 11124166115 |
9 | 3151474767 |
10 | 1230040141 |
11 | 581364400 |
12 | 2a3b30951 |
13 | 167ab1805 |
14 | b950d501 |
15 | 72ec1511 |
hex | 4950ec4d |
1230040141 has 12 divisors (see below), whose sum is σ = 1357669852. Its totient is φ = 1113552000.
The previous prime is 1230040129. The next prime is 1230040157. The reversal of 1230040141 is 1410400321.
It can be written as a sum of positive squares in 2 ways, for example, as 420865225 + 809174916 = 20515^2 + 28446^2 .
It is not a de Polignac number, because 1230040141 - 25 = 1230040109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230040121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8071 + ... + 50251.
Almost surely, 21230040141 is an apocalyptic number.
1230040141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1230040141 is a deficient number, since it is larger than the sum of its proper divisors (127629711).
1230040141 is a wasteful number, since it uses less digits than its factorization.
1230040141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42444 (or 42433 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1230040141 is about 35071.9281049674. The cubic root of 1230040141 is about 1071.4529250447.
Adding to 1230040141 its reverse (1410400321), we get a palindrome (2640440462).
It can be divided in two parts, 12300 and 40141, that added together give a square (52441 = 2292).
The spelling of 1230040141 in words is "one billion, two hundred thirty million, forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •