Base | Representation |
---|---|
bin | 100000000101100101011101… |
… | …100011011111100111011100 |
3 | 200111200001202201220000022102 |
4 | 200011211131203133213130 |
5 | 121444112420331432200 |
6 | 1220050122420304232 |
7 | 41503451422214615 |
oct | 4005453543374734 |
9 | 614601681800272 |
10 | 141121310030300 |
11 | 40a6923653a426 |
12 | 139b2309242078 |
13 | 60988b4400b52 |
14 | 26bc444a4cc0c |
15 | 114ad50c2a6d5 |
hex | 80595d8df9dc |
141121310030300 has 36 divisors (see below), whose sum is σ = 306238657815216. Its totient is φ = 56447525846400.
The previous prime is 141121310030237. The next prime is 141121310030341. The reversal of 141121310030300 is 3030013121141.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6780632 + ... + 18116831.
It is an arithmetic number, because the mean of its divisors is an integer number (8506629383756).
Almost surely, 2141121310030300 is an apocalyptic number.
141121310030300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141121310030300 is an abundant number, since it is smaller than the sum of its proper divisors (165117347784916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141121310030300 is a wasteful number, since it uses less digits than its factorization.
141121310030300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24954158 (or 24954151 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 141121310030300 its reverse (3030013121141), we get a palindrome (144151323151441).
The spelling of 141121310030300 in words is "one hundred forty-one trillion, one hundred twenty-one billion, three hundred ten million, thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •