Base | Representation |
---|---|
bin | 1000001110001011110… |
… | …1101000111011001100 |
3 | 111111120201200222122111 |
4 | 2003202331220323030 |
5 | 4303233132401300 |
6 | 144515440153404 |
7 | 13130140446661 |
oct | 2034275507314 |
9 | 444521628574 |
10 | 141246762700 |
11 | 549a212a43a |
12 | 2345b308864 |
13 | 1041cc7a1c4 |
14 | 6b9d051a68 |
15 | 3a1a3e79ba |
hex | 20e2f68ecc |
141246762700 has 72 divisors (see below), whose sum is σ = 329855700384. Its totient is φ = 52303488000.
The previous prime is 141246762697. The next prime is 141246762733. The reversal of 141246762700 is 7267642141.
141246762700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1412467627002 (a number of 23 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 577336 + ... + 784735.
It is an arithmetic number, because the mean of its divisors is an integer number (4581329172).
Almost surely, 2141246762700 is an apocalyptic number.
141246762700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141246762700 is an abundant number, since it is smaller than the sum of its proper divisors (188608937684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141246762700 is a wasteful number, since it uses less digits than its factorization.
141246762700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1362163 (or 1362156 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 40.
The spelling of 141246762700 in words is "one hundred forty-one billion, two hundred forty-six million, seven hundred sixty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •