Base | Representation |
---|---|
bin | 11111111010011010001100… |
… | …111010011010000110110101 |
3 | 200101221122102011201111002000 |
4 | 133322122030322122012311 |
5 | 121344022032141421323 |
6 | 1214301230212205513 |
7 | 41364122514563004 |
oct | 3772321472320665 |
9 | 611848364644060 |
10 | 140353305420213 |
11 | 407a25589a7736 |
12 | 138a94b2009899 |
13 | 604134c03b472 |
14 | 26931c9b4ac3b |
15 | 1135da1813e43 |
hex | 7fa68ce9a1b5 |
140353305420213 has 64 divisors (see below), whose sum is σ = 208546002362880. Its totient is φ = 93292608397824.
The previous prime is 140353305420199. The next prime is 140353305420239. The reversal of 140353305420213 is 312024503353041.
140353305420213 is a `hidden beast` number, since 1 + 40 + 3 + 5 + 330 + 54 + 20 + 213 = 666.
It is not a de Polignac number, because 140353305420213 - 233 = 140344715485621 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140353305420253) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 52704957520 + ... + 52704960182.
It is an arithmetic number, because the mean of its divisors is an integer number (3258531286920).
Almost surely, 2140353305420213 is an apocalyptic number.
It is an amenable number.
140353305420213 is a deficient number, since it is larger than the sum of its proper divisors (68192696942667).
140353305420213 is a wasteful number, since it uses less digits than its factorization.
140353305420213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6715 (or 6709 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 36.
Adding to 140353305420213 its reverse (312024503353041), we get a palindrome (452377808773254).
The spelling of 140353305420213 in words is "one hundred forty trillion, three hundred fifty-three billion, three hundred five million, four hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •