Base | Representation |
---|---|
bin | 100001100101010101010010… |
… | …000011100101010010110101 |
3 | 201100222002010010120110220211 |
4 | 201211111102003211102311 |
5 | 123324413130243404140 |
6 | 1242044523401425421 |
7 | 43053021433613023 |
oct | 4145252203452265 |
9 | 640862103513824 |
10 | 147701007013045 |
11 | 430757109a0a72 |
12 | 1469554049b271 |
13 | 64551b6cca265 |
14 | 2868aa447d713 |
15 | 12120973ac2ea |
hex | 8655520e54b5 |
147701007013045 has 4 divisors (see below), whose sum is σ = 177241208415660. Its totient is φ = 118160805610432.
The previous prime is 147701007012851. The next prime is 147701007013103. The reversal of 147701007013045 is 540310700107741.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 64568954901361 + 83132052111684 = 8035481^2 + 9117678^2 .
It is a cyclic number.
It is not a de Polignac number, because 147701007013045 - 219 = 147701006488757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 147701007012989 and 147701007013007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14770100701300 + ... + 14770100701309.
It is an arithmetic number, because the mean of its divisors is an integer number (44310302103915).
Almost surely, 2147701007013045 is an apocalyptic number.
It is an amenable number.
147701007013045 is a deficient number, since it is larger than the sum of its proper divisors (29540201402615).
147701007013045 is an equidigital number, since it uses as much as digits as its factorization.
147701007013045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29540201402614.
The product of its (nonzero) digits is 82320, while the sum is 40.
The spelling of 147701007013045 in words is "one hundred forty-seven trillion, seven hundred one billion, seven million, thirteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •