Base | Representation |
---|---|
bin | 100000000100011011001000… |
… | …101101011001100000110110 |
3 | 200111101102202212122122201002 |
4 | 200010123020231121200312 |
5 | 121441310444333111410 |
6 | 1215545323331403302 |
7 | 41464624636146113 |
oct | 4004331055314066 |
9 | 614342685578632 |
10 | 141041503410230 |
11 | 40a38402804575 |
12 | 1399a956153532 |
13 | 6091206376037 |
14 | 26b863385190a |
15 | 1148c2e7097a5 |
hex | 8046c8b59836 |
141041503410230 has 16 divisors (see below), whose sum is σ = 256933437539184. Its totient is φ = 55736883275040.
The previous prime is 141041503410221. The next prime is 141041503410257. The reversal of 141041503410230 is 32014305140141.
It is a junction number, because it is equal to n+sod(n) for n = 141041503410193 and 141041503410202.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 84964760261 + ... + 84964761920.
It is an arithmetic number, because the mean of its divisors is an integer number (16058339846199).
Almost surely, 2141041503410230 is an apocalyptic number.
141041503410230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141041503410230 is a deficient number, since it is larger than the sum of its proper divisors (115891934128954).
141041503410230 is a wasteful number, since it uses less digits than its factorization.
141041503410230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169929522271.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 141041503410230 its reverse (32014305140141), we get a palindrome (173055808550371).
The spelling of 141041503410230 in words is "one hundred forty-one trillion, forty-one billion, five hundred three million, four hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •