Base | Representation |
---|---|
bin | 100000000111010101010011… |
… | …100010101001100100001010 |
3 | 200112002112202002110111210202 |
4 | 200013111103202221210022 |
5 | 122003044342141333114 |
6 | 1220221223125212202 |
7 | 41515232405514644 |
oct | 4007252342514412 |
9 | 615075662414722 |
10 | 141241401121034 |
11 | 41005161860345 |
12 | 13a11643561062 |
13 | 60a701242c756 |
14 | 26c4198107894 |
15 | 114e02dbc5cde |
hex | 8075538a990a |
141241401121034 has 32 divisors (see below), whose sum is σ = 224558984514960. Its totient is φ = 66397093613568.
The previous prime is 141241401120973. The next prime is 141241401121057. The reversal of 141241401121034 is 430121104142141.
141241401121034 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 8 ways, for example, as 84397386108025 + 56844015013009 = 9186805^2 + 7539497^2 .
It is a junction number, because it is equal to n+sod(n) for n = 141241401120988 and 141241401121006.
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 15 ways as a sum of consecutive naturals, for example, 967274222 + ... + 967420230.
Almost surely, 2141241401121034 is an apocalyptic number.
141241401121034 is a deficient number, since it is larger than the sum of its proper divisors (83317583393926).
141241401121034 is a wasteful number, since it uses less digits than its factorization.
141241401121034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175562.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 141241401121034 its reverse (430121104142141), we get a palindrome (571362505263175).
The spelling of 141241401121034 in words is "one hundred forty-one trillion, two hundred forty-one billion, four hundred one million, one hundred twenty-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •