Base | Representation |
---|---|
bin | 11111111000101001101111… |
… | …011101101000011011001111 |
3 | 200101112002201200100000120121 |
4 | 133320221233131220123033 |
5 | 121340032231334100020 |
6 | 1214125540052525411 |
7 | 41352316241601136 |
oct | 3770515735503317 |
9 | 611462650300517 |
10 | 140232552253135 |
11 | 40756322989a91 |
12 | 1388a012020867 |
13 | 6032b46abac04 |
14 | 268b41278a91d |
15 | 1132b85687baa |
hex | 7f8a6f7686cf |
140232552253135 has 4 divisors (see below), whose sum is σ = 168279062703768. Its totient is φ = 112186041802504.
The previous prime is 140232552253127. The next prime is 140232552253163. The reversal of 140232552253135 is 531352255232041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140232552253135 - 23 = 140232552253127 is a prime.
It is a super-2 number, since 2×1402325522531352 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140232552253091 and 140232552253100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14023255225309 + ... + 14023255225318.
It is an arithmetic number, because the mean of its divisors is an integer number (42069765675942).
Almost surely, 2140232552253135 is an apocalyptic number.
140232552253135 is a deficient number, since it is larger than the sum of its proper divisors (28046510450633).
140232552253135 is an equidigital number, since it uses as much as digits as its factorization.
140232552253135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28046510450632.
The product of its (nonzero) digits is 1080000, while the sum is 43.
The spelling of 140232552253135 in words is "one hundred forty trillion, two hundred thirty-two billion, five hundred fifty-two million, two hundred fifty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •