Base | Representation |
---|---|
bin | 1000001101010100011… |
… | …1010101001100011101 |
3 | 111110222112111212112112 |
4 | 2003111013111030131 |
5 | 4302244143003201 |
6 | 144440420243405 |
7 | 13121316545504 |
oct | 2032507251435 |
9 | 443875455475 |
10 | 141014422301 |
11 | 54892a68685 |
12 | 233b5540565 |
13 | 103b3aab88c |
14 | 6b7a25183b |
15 | 3a04d010bb |
hex | 20d51d531d |
141014422301 has 16 divisors (see below), whose sum is σ = 143731745520. Its totient is φ = 138310778880.
The previous prime is 141014422291. The next prime is 141014422309. The reversal of 141014422301 is 103224410141.
It can be written as a sum of positive squares in 8 ways, for example, as 53310192100 + 87704230201 = 230890^2 + 296149^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141014422301 is a prime.
It is a super-2 number, since 2×1410144223012 (a number of 23 digits) 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 (141014422309) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45648965 + ... + 45652053.
It is an arithmetic number, because the mean of its divisors is an integer number (8983234095).
Almost surely, 2141014422301 is an apocalyptic number.
It is an amenable number.
141014422301 is a deficient number, since it is larger than the sum of its proper divisors (2717323219).
141014422301 is a wasteful number, since it uses less digits than its factorization.
141014422301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5024.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 141014422301 its reverse (103224410141), we get a palindrome (244238832442).
The spelling of 141014422301 in words is "one hundred forty-one billion, fourteen million, four hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •