Base | Representation |
---|---|
bin | 11111111101001100010100… |
… | …010011110000011001111100 |
3 | 200102121221001201120201120120 |
4 | 133331030110103300121330 |
5 | 121410140222210102312 |
6 | 1214525135534214540 |
7 | 41414003051062203 |
oct | 3775142423603174 |
9 | 612557051521516 |
10 | 140544555550332 |
11 | 4086667a68a10a |
12 | 1391a587354450 |
13 | 60563aa66702b |
14 | 269c56db2823a |
15 | 113ad46a1928c |
hex | 7fd3144f067c |
140544555550332 has 24 divisors (see below), whose sum is σ = 330839396254416. Its totient is φ = 46433599473408.
The previous prime is 140544555550319. The next prime is 140544555550361. The reversal of 140544555550332 is 233055555445041.
140544555550332 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51823212343 + ... + 51823215054.
It is an arithmetic number, because the mean of its divisors is an integer number (13784974843934).
Almost surely, 2140544555550332 is an apocalyptic number.
140544555550332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
140544555550332 is an abundant number, since it is smaller than the sum of its proper divisors (190294840704084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140544555550332 is a wasteful number, since it uses less digits than its factorization.
140544555550332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103646427517 (or 103646427515 counting only the distinct ones).
The product of its (nonzero) digits is 18000000, while the sum is 51.
The spelling of 140544555550332 in words is "one hundred forty trillion, five hundred forty-four billion, five hundred fifty-five million, five hundred fifty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •