Base | Representation |
---|---|
bin | 11111111000110001101110… |
… | …110111111101011000101110 |
3 | 200101112220212122020011210122 |
4 | 133320301232313331120232 |
5 | 121340202314332441420 |
6 | 1214133515313204542 |
7 | 41353041665105264 |
oct | 3770615667753056 |
9 | 611486778204718 |
10 | 140241132312110 |
11 | 40759a26125315 |
12 | 1388b807560752 |
13 | 60338b356729b |
14 | 268b9c80ca434 |
15 | 1132ed8a62725 |
hex | 7f8c6edfd62e |
140241132312110 has 32 divisors (see below), whose sum is σ = 254122972294464. Its totient is φ = 55721184480000.
The previous prime is 140241132312103. The next prime is 140241132312121. The reversal of 140241132312110 is 11213231142041.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 140241132312110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19246490 + ... + 25512930.
It is an arithmetic number, because the mean of its divisors is an integer number (7941342884202).
Almost surely, 2140241132312110 is an apocalyptic number.
140241132312110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140241132312110 is a deficient number, since it is larger than the sum of its proper divisors (113881839982354).
140241132312110 is a wasteful number, since it uses less digits than its factorization.
140241132312110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6281420.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 140241132312110 its reverse (11213231142041), we get a palindrome (151454363454151).
The spelling of 140241132312110 in words is "one hundred forty trillion, two hundred forty-one billion, one hundred thirty-two million, three hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •