Base | Representation |
---|---|
bin | 100000001000101001111110… |
… | …001010000010011111000101 |
3 | 200112102020101201022112022102 |
4 | 200020221332022002133011 |
5 | 122011042032430344023 |
6 | 1220331100030441445 |
7 | 41524631255616242 |
oct | 4010517612023705 |
9 | 615366351275272 |
10 | 141332310403013 |
11 | 4103a772773444 |
12 | 13a27194963285 |
13 | 60b276c7481b2 |
14 | 26c873da9a5c9 |
15 | 115159ecb4628 |
hex | 808a7e2827c5 |
141332310403013 has 8 divisors (see below), whose sum is σ = 142754154977280. Its totient is φ = 139915293824880.
The previous prime is 141332310402973. The next prime is 141332310403043. The reversal of 141332310403013 is 310304013233141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141332310403013 - 28 = 141332310402757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141332310403043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1206940193 + ... + 1207057286.
It is an arithmetic number, because the mean of its divisors is an integer number (17844269372160).
Almost surely, 2141332310403013 is an apocalyptic number.
It is an amenable number.
141332310403013 is a deficient number, since it is larger than the sum of its proper divisors (1421844574267).
141332310403013 is a wasteful number, since it uses less digits than its factorization.
141332310403013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2413998067.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 141332310403013 its reverse (310304013233141), we get a palindrome (451636323636154).
The spelling of 141332310403013 in words is "one hundred forty-one trillion, three hundred thirty-two billion, three hundred ten million, four hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •