Base | Representation |
---|---|
bin | 1011101100111110… |
… | …0000101010001011 |
3 | 22002221002220222022 |
4 | 2323033200222023 |
5 | 22413144432243 |
6 | 1235415115055 |
7 | 140563335050 |
oct | 27317405213 |
9 | 8087086868 |
10 | 3141405323 |
11 | 1372272351 |
12 | 738072a8b |
13 | 3b0a94424 |
14 | 21b2d5027 |
15 | 135bc6b68 |
hex | bb3e0a8b |
3141405323 has 8 divisors (see below), whose sum is σ = 3625724640. Its totient is φ = 2665972800.
The previous prime is 3141405259. The next prime is 3141405329. The reversal of 3141405323 is 3235041413.
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 3141405323 - 26 = 3141405259 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3141405292 and 3141405301.
It is not an unprimeable number, because it can be changed into a prime (3141405329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2220938 + ... + 2222351.
It is an arithmetic number, because the mean of its divisors is an integer number (453215580).
Almost surely, 23141405323 is an apocalyptic number.
3141405323 is a deficient number, since it is larger than the sum of its proper divisors (484319317).
3141405323 is a wasteful number, since it uses less digits than its factorization.
3141405323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4443397.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 3141405323 is about 56048.2410339522. The cubic root of 3141405323 is about 1464.5627761791.
Adding to 3141405323 its reverse (3235041413), we get a palindrome (6376446736).
The spelling of 3141405323 in words is "three billion, one hundred forty-one million, four hundred five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •