Base | Representation |
---|---|
bin | 11111111000100010001011… |
… | …011001100110000011100001 |
3 | 200101111022202200210202020120 |
4 | 133320202023121212003201 |
5 | 121334414113320203210 |
6 | 1214122114142430453 |
7 | 41351611056352260 |
oct | 3770421331460341 |
9 | 611438680722216 |
10 | 140224431022305 |
11 | 4075293573a073 |
12 | 13888526292429 |
13 | 603215140c896 |
14 | 268ac81d665d7 |
15 | 113285c6e2270 |
hex | 7f888b6660e1 |
140224431022305 has 256 divisors, whose sum is σ = 270516879360000. Its totient is φ = 60683234641920.
The previous prime is 140224431022237. The next prime is 140224431022363. The reversal of 140224431022305 is 503220134422041.
It is a happy number.
It is not a de Polignac number, because 140224431022305 - 221 = 140224428925153 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 46757061196 + ... + 46757064194.
It is an arithmetic number, because the mean of its divisors is an integer number (1056706560000).
Almost surely, 2140224431022305 is an apocalyptic number.
140224431022305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
140224431022305 is a deficient number, since it is larger than the sum of its proper divisors (130292448337695).
140224431022305 is a wasteful number, since it uses less digits than its factorization.
140224431022305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4804.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 140224431022305 its reverse (503220134422041), we get a palindrome (643444565444346).
The spelling of 140224431022305 in words is "one hundred forty trillion, two hundred twenty-four billion, four hundred thirty-one million, twenty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •