Base | Representation |
---|---|
bin | 1000001001111101110… |
… | …0111101000100110010 |
3 | 111101122210102211100021 |
4 | 2002133130331010302 |
5 | 4243423203333020 |
6 | 144211215514054 |
7 | 13060105243423 |
oct | 2023734750462 |
9 | 441583384307 |
10 | 140114121010 |
11 | 5447084aa26 |
12 | 231a3b2892a |
13 | 1029c40b016 |
14 | 6ad285764a |
15 | 39a0c651aa |
hex | 209f73d132 |
140114121010 has 8 divisors (see below), whose sum is σ = 252205417836. Its totient is φ = 56045648400.
The previous prime is 140114120987. The next prime is 140114121013. The reversal of 140114121010 is 10121411041.
140114121010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 135872594881 + 4241526129 = 368609^2 + 65127^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (140114121013) 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 3 ways as a sum of consecutive naturals, for example, 7005706041 + ... + 7005706060.
Almost surely, 2140114121010 is an apocalyptic number.
140114121010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140114121010 is a deficient number, since it is larger than the sum of its proper divisors (112091296826).
140114121010 is a wasteful number, since it uses less digits than its factorization.
140114121010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14011412108.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 140114121010 its reverse (10121411041), we get a palindrome (150235532051).
The spelling of 140114121010 in words is "one hundred forty billion, one hundred fourteen million, one hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •