Base | Representation |
---|---|
bin | 1000010000111011100… |
… | …1100110110101111000 |
3 | 111120111002202121011122 |
4 | 2010032321212311320 |
5 | 4311240334344341 |
6 | 145120531444412 |
7 | 13154331156230 |
oct | 2041671466570 |
9 | 446432677148 |
10 | 141983903096 |
11 | 55240236982 |
12 | 23626156708 |
13 | 105098c1659 |
14 | 6c2ccd6cc0 |
15 | 3a5eea494b |
hex | 210ee66d78 |
141983903096 has 16 divisors (see below), whose sum is σ = 304251221040. Its totient is φ = 60850244160.
The previous prime is 141983903077. The next prime is 141983903101. The reversal of 141983903096 is 690309389141.
It is a happy number.
141983903096 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
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 3 ways as a sum of consecutive naturals, for example, 1267713365 + ... + 1267713476.
It is an arithmetic number, because the mean of its divisors is an integer number (19015701315).
Almost surely, 2141983903096 is an apocalyptic number.
It is an amenable number.
141983903096 is an abundant number, since it is smaller than the sum of its proper divisors (162267317944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141983903096 is a wasteful number, since it uses less digits than its factorization.
141983903096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2535426854 (or 2535426850 counting only the distinct ones).
The product of its (nonzero) digits is 1259712, while the sum is 53.
The spelling of 141983903096 in words is "one hundred forty-one billion, nine hundred eighty-three million, nine hundred three thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •