Base | Representation |
---|---|
bin | 1010010011101001110… |
… | …10001010010111100001 |
3 | 1020212010020022010020201 |
4 | 11021310322022113201 |
5 | 21300244033102040 |
6 | 430405500105201 |
7 | 34405064320051 |
oct | 5116472122741 |
9 | 1225106263221 |
10 | 354148722145 |
11 | 1272147a2739 |
12 | 58777835201 |
13 | 2751c2623ba |
14 | 131d885b561 |
15 | 932b3a4a9a |
hex | 5274e8a5e1 |
354148722145 has 8 divisors (see below), whose sum is σ = 436464371304. Its totient is φ = 275661707904.
The previous prime is 354148722049. The next prime is 354148722181. The reversal of 354148722145 is 541227841453.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 14977598689 + 339171123456 = 122383^2 + 582384^2 .
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 354148722145 - 27 = 354148722017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 354148722095 and 354148722104.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 957158524 + ... + 957158893.
It is an arithmetic number, because the mean of its divisors is an integer number (54558046413).
Almost surely, 2354148722145 is an apocalyptic number.
It is an amenable number.
354148722145 is a deficient number, since it is larger than the sum of its proper divisors (82315649159).
354148722145 is a wasteful number, since it uses less digits than its factorization.
354148722145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1914317459.
The product of its digits is 1075200, while the sum is 46.
The spelling of 354148722145 in words is "three hundred fifty-four billion, one hundred forty-eight million, seven hundred twenty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •