Base | Representation |
---|---|
bin | 100000001000101001111110… |
… | …001010000010011111000100 |
3 | 200112102020101201022112022101 |
4 | 200020221332022002133010 |
5 | 122011042032430344022 |
6 | 1220331100030441444 |
7 | 41524631255616241 |
oct | 4010517612023704 |
9 | 615366351275271 |
10 | 141332310403012 |
11 | 4103a772773443 |
12 | 13a27194963284 |
13 | 60b276c7481b1 |
14 | 26c873da9a5c8 |
15 | 115159ecb4627 |
hex | 808a7e2827c4 |
141332310403012 has 12 divisors (see below), whose sum is σ = 247546054525756. Its totient is φ = 70604866252800.
The previous prime is 141332310402973. The next prime is 141332310403043. The reversal of 141332310403012 is 210304013233141.
141332310403012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 116744437767556 + 24587872635456 = 10804834^2 + 4958616^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15322231989 + ... + 15322241212.
Almost surely, 2141332310403012 is an apocalyptic number.
It is an amenable number.
141332310403012 is a deficient number, since it is larger than the sum of its proper divisors (106213744122744).
141332310403012 is a wasteful number, since it uses less digits than its factorization.
141332310403012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30644474358 (or 30644474356 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 141332310403012 its reverse (210304013233141), we get a palindrome (351636323636153).
The spelling of 141332310403012 in words is "one hundred forty-one trillion, three hundred thirty-two billion, three hundred ten million, four hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •