Base | Representation |
---|---|
bin | 1000001010111010101… |
… | …1100010101110001101 |
3 | 111102022121011200101120 |
4 | 2002232223202232031 |
5 | 4244434104302334 |
6 | 144252423431153 |
7 | 13066326641304 |
oct | 2025653425615 |
9 | 442277150346 |
10 | 140369603469 |
11 | 54591a88757 |
12 | 232555b54b9 |
13 | 1031031cc84 |
14 | 6b1875d43b |
15 | 39b83cd949 |
hex | 20aeae2b8d |
140369603469 has 16 divisors (see below), whose sum is σ = 191523925824. Its totient is φ = 91397779200.
The previous prime is 140369603459. The next prime is 140369603519. The reversal of 140369603469 is 964306963041.
140369603469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140369603469 - 29 = 140369602957 is a prime.
It is a super-2 number, since 2×1403696034692 (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 (140369603459) 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 15 ways as a sum of consecutive naturals, for example, 3374739 + ... + 3416079.
It is an arithmetic number, because the mean of its divisors is an integer number (11970245364).
Almost surely, 2140369603469 is an apocalyptic number.
It is an amenable number.
140369603469 is a deficient number, since it is larger than the sum of its proper divisors (51154322355).
140369603469 is a wasteful number, since it uses less digits than its factorization.
140369603469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67708.
The product of its (nonzero) digits is 2519424, while the sum is 51.
The spelling of 140369603469 in words is "one hundred forty billion, three hundred sixty-nine million, six hundred three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •