Base | Representation |
---|---|
bin | 11111111000011000110110… |
… | …001111101001000001111101 |
3 | 200101110100220111000202211111 |
4 | 133320120312033221001331 |
5 | 121334233104034240401 |
6 | 1214113340053122021 |
7 | 41351104564532023 |
oct | 3770306617510175 |
9 | 611410814022744 |
10 | 140214412415101 |
11 | 40749664476202 |
12 | 138865ab029311 |
13 | 6031215908c3b |
14 | 268a5b155c713 |
15 | 1132472daae51 |
hex | 7f86363e907d |
140214412415101 has 8 divisors (see below), whose sum is σ = 148462865426880. Its totient is φ = 131966020114368.
The previous prime is 140214412415083. The next prime is 140214412415123. The reversal of 140214412415101 is 101514214412041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140214412415101 - 25 = 140214412415069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140214412415201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10379481 + ... + 19701838.
It is an arithmetic number, because the mean of its divisors is an integer number (18557858178360).
Almost surely, 2140214412415101 is an apocalyptic number.
It is an amenable number.
140214412415101 is a deficient number, since it is larger than the sum of its proper divisors (8248453011779).
140214412415101 is a wasteful number, since it uses less digits than its factorization.
140214412415101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30355523.
The product of its (nonzero) digits is 5120, while the sum is 31.
Adding to 140214412415101 its reverse (101514214412041), we get a palindrome (241728626827142).
The spelling of 140214412415101 in words is "one hundred forty trillion, two hundred fourteen billion, four hundred twelve million, four hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •