Base | Representation |
---|---|
bin | 11111111011101010111100… |
… | …010101111010001011000011 |
3 | 200102020221012002211002011020 |
4 | 133323222330111322023003 |
5 | 121401432110112121030 |
6 | 1214405125012520523 |
7 | 41403312063621555 |
oct | 3773527425721303 |
9 | 612227162732136 |
10 | 140440000504515 |
11 | 408262a7026738 |
12 | 13902268020143 |
13 | 6049587249b0a |
14 | 2697491b4d4d5 |
15 | 113827796b510 |
hex | 7fbabc57a2c3 |
140440000504515 has 8 divisors (see below), whose sum is σ = 224704000807248. Its totient is φ = 74901333602400.
The previous prime is 140440000504439. The next prime is 140440000504547. The reversal of 140440000504515 is 515405000044041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140440000504515 - 27 = 140440000504387 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4681333350136 + ... + 4681333350165.
It is an arithmetic number, because the mean of its divisors is an integer number (28088000100906).
Almost surely, 2140440000504515 is an apocalyptic number.
140440000504515 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
140440000504515 is a deficient number, since it is larger than the sum of its proper divisors (84264000302733).
140440000504515 is an equidigital number, since it uses as much as digits as its factorization.
140440000504515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9362666700309.
The product of its (nonzero) digits is 32000, while the sum is 33.
Adding to 140440000504515 its reverse (515405000044041), we get a palindrome (655845000548556).
The spelling of 140440000504515 in words is "one hundred forty trillion, four hundred forty billion, five hundred four thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •