Base | Representation |
---|---|
bin | 1000001010111101101… |
… | …1100101011100111101 |
3 | 111102100110212112020120 |
4 | 2002233123211130331 |
5 | 4300000320310230 |
6 | 144253553405153 |
7 | 13066541663631 |
oct | 2025733453475 |
9 | 442313775216 |
10 | 140382197565 |
11 | 545990aa8a5 |
12 | 232598697b9 |
13 | 10312b0c4bc |
14 | 6b1a2badc1 |
15 | 39b956a310 |
hex | 20af6e573d |
140382197565 has 16 divisors (see below), whose sum is σ = 224990301888. Its totient is φ = 74744243456.
The previous prime is 140382197467. The next prime is 140382197569. The reversal of 140382197565 is 565791283041.
It is a cyclic number.
It is not a de Polignac number, because 140382197565 - 219 = 140381673277 is a prime.
It is a super-2 number, since 2×1403821975652 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140382197569) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7882179 + ... + 7899968.
It is an arithmetic number, because the mean of its divisors is an integer number (14061893868).
It is a 2-persistent number, because it is pandigital, and so is 2⋅140382197565 = 280764395130, but 3⋅140382197565 = 421146592695 is not.
Almost surely, 2140382197565 is an apocalyptic number.
140382197565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
140382197565 is a deficient number, since it is larger than the sum of its proper divisors (84608104323).
140382197565 is a wasteful number, since it uses less digits than its factorization.
140382197565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15782748.
The product of its (nonzero) digits is 1814400, while the sum is 51.
The spelling of 140382197565 in words is "one hundred forty billion, three hundred eighty-two million, one hundred ninety-seven thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •