Base | Representation |
---|---|
bin | 11111111000011001011111… |
… | …010000010010110100000111 |
3 | 200101110102200102200200011102 |
4 | 133320121133100102310013 |
5 | 121334241011203431403 |
6 | 1214113532232130315 |
7 | 41351130620666555 |
oct | 3770313720226407 |
9 | 611412612620142 |
10 | 140215100452103 |
11 | 40749987894626 |
12 | 1388676153699b |
13 | 60312c531a121 |
14 | 268a638aa0bd5 |
15 | 11324b34b8b88 |
hex | 7f865f412d07 |
140215100452103 has 8 divisors (see below), whose sum is σ = 140398226688720. Its totient is φ = 140031976273920.
The previous prime is 140215100452033. The next prime is 140215100452109. The reversal of 140215100452103 is 301254001512041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140215100452103 - 216 = 140215100386567 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140215100452109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 174706313 + ... + 175507053.
It is an arithmetic number, because the mean of its divisors is an integer number (17549778336090).
Almost surely, 2140215100452103 is an apocalyptic number.
140215100452103 is a deficient number, since it is larger than the sum of its proper divisors (183126236617).
140215100452103 is an equidigital number, since it uses as much as digits as its factorization.
140215100452103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1029217.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 140215100452103 its reverse (301254001512041), we get a palindrome (441469101964144).
The spelling of 140215100452103 in words is "one hundred forty trillion, two hundred fifteen billion, one hundred million, four hundred fifty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •