Base | Representation |
---|---|
bin | 1000001111001000010… |
… | …1011001010011010110 |
3 | 111112020102001211211100 |
4 | 2003302011121103112 |
5 | 4304243104012402 |
6 | 145000541450530 |
7 | 13136341005030 |
oct | 2036205312326 |
9 | 445212054740 |
10 | 141500454102 |
11 | 55012354557 |
12 | 23510270a46 |
13 | 104606b2b67 |
14 | 6bc4a0cc50 |
15 | 3a3280a71c |
hex | 20f21594d6 |
141500454102 has 48 divisors (see below), whose sum is σ = 350403629472. Its totient is φ = 40426214400.
The previous prime is 141500454097. The next prime is 141500454103. The reversal of 141500454102 is 201454005141.
141500454102 is a `hidden beast` number, since 1 + 4 + 1 + 500 + 4 + 54 + 102 = 666.
It is a super-2 number, since 2×1415004541022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141500454103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3276852 + ... + 3319752.
It is an arithmetic number, because the mean of its divisors is an integer number (7300075614).
Almost surely, 2141500454102 is an apocalyptic number.
141500454102 is an abundant number, since it is smaller than the sum of its proper divisors (208903175370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141500454102 is a wasteful number, since it uses less digits than its factorization.
141500454102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69093 (or 69090 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 141500454102 its reverse (201454005141), we get a palindrome (342954459243).
The spelling of 141500454102 in words is "one hundred forty-one billion, five hundred million, four hundred fifty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •