Base | Representation |
---|---|
bin | 1000001001110001011… |
… | …0111111000001111001 |
3 | 111101112011210012201111 |
4 | 2002130112333001321 |
5 | 4243321412141010 |
6 | 144202123320321 |
7 | 13055605156600 |
oct | 2023426770171 |
9 | 441464705644 |
10 | 140062224505 |
11 | 54444524355 |
12 | 2318a6800a1 |
13 | 1029173a628 |
14 | 6ac99c8a37 |
15 | 399b41358a |
hex | 209c5bf079 |
140062224505 has 48 divisors (see below), whose sum is σ = 208761024384. Its totient is φ = 89730305280.
The previous prime is 140062224439. The next prime is 140062224509. The reversal of 140062224505 is 505422260041.
140062224505 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 140062224505 - 225 = 140028670073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140062224509) 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 47 ways as a sum of consecutive naturals, for example, 46716 + ... + 531325.
It is an arithmetic number, because the mean of its divisors is an integer number (4349188008).
Almost surely, 2140062224505 is an apocalyptic number.
It is an amenable number.
140062224505 is a deficient number, since it is larger than the sum of its proper divisors (68698799879).
140062224505 is a wasteful number, since it uses less digits than its factorization.
140062224505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578126 (or 578119 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 140062224505 its reverse (505422260041), we get a palindrome (645484484546).
The spelling of 140062224505 in words is "one hundred forty billion, sixty-two million, two hundred twenty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •