Base | Representation |
---|---|
bin | 1000001111010000111… |
… | …0010111111001000011 |
3 | 111112022220122011021101 |
4 | 2003310032113321003 |
5 | 4304331302041201 |
6 | 145004303235231 |
7 | 13140255140650 |
oct | 2036416277103 |
9 | 445286564241 |
10 | 141536362051 |
11 | 5503064a747 |
12 | 235202a8b17 |
13 | 10467c75c76 |
14 | 6bc96b8c27 |
15 | 3a35a4ed01 |
hex | 20f4397e43 |
141536362051 has 32 divisors (see below), whose sum is σ = 164523340800. Its totient is φ = 119263795200.
The previous prime is 141536362049. The next prime is 141536362063. The reversal of 141536362051 is 150263635141.
141536362051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 141536362051 - 21 = 141536362049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141536362051.
It is not an unprimeable number, because it can be changed into a prime (141536363051) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 51862455 + ... + 51865183.
It is an arithmetic number, because the mean of its divisors is an integer number (5141354400).
Almost surely, 2141536362051 is an apocalyptic number.
141536362051 is a deficient number, since it is larger than the sum of its proper divisors (22986978749).
141536362051 is a wasteful number, since it uses less digits than its factorization.
141536362051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3379.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 141536362051 its reverse (150263635141), we get a palindrome (291799997192).
The spelling of 141536362051 in words is "one hundred forty-one billion, five hundred thirty-six million, three hundred sixty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •