Base | Representation |
---|---|
bin | 1000001101011100111… |
… | …1000101110000100111 |
3 | 111111002000110221121000 |
4 | 2003113033011300213 |
5 | 4302332300320123 |
6 | 144444131124343 |
7 | 13122231210612 |
oct | 2032717056047 |
9 | 444060427530 |
10 | 141050010663 |
11 | 54901065751 |
12 | 234054436b3 |
13 | 103bb28c393 |
14 | 6b80c77179 |
15 | 3a07ed0b43 |
hex | 20d73c5c27 |
141050010663 has 16 divisors (see below), whose sum is σ = 208971986400. Its totient is φ = 94029287040.
The previous prime is 141050010617. The next prime is 141050010821. The reversal of 141050010663 is 366010050141.
141050010663 is a `hidden beast` number, since 141 + 0 + 500 + 10 + 6 + 6 + 3 = 666.
141050010663 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 141050010663 - 212 = 141050006567 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141050010163) 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 15 ways as a sum of consecutive naturals, for example, 609583 + ... + 808511.
It is an arithmetic number, because the mean of its divisors is an integer number (13060749150).
Almost surely, 2141050010663 is an apocalyptic number.
141050010663 is a deficient number, since it is larger than the sum of its proper divisors (67921975737).
141050010663 is a wasteful number, since it uses less digits than its factorization.
141050010663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225199 (or 225193 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 141050010663 in words is "one hundred forty-one billion, fifty million, ten thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •