Base | Representation |
---|---|
bin | 101101010100100010000… |
… | …010011000111011001011 |
3 | 102000201212110002110122120 |
4 | 231110202002120323023 |
5 | 402011314104410243 |
6 | 10342425035222323 |
7 | 441003201052656 |
oct | 55244202307313 |
9 | 12021773073576 |
10 | 3114422341323 |
11 | aa0901245327 |
12 | 4237198a79a3 |
13 | 1978c52b2b07 |
14 | aaa4b56c89d |
15 | 5602ebd9c83 |
hex | 2d522098ecb |
3114422341323 has 8 divisors (see below), whose sum is σ = 4155481302528. Its totient is φ = 2074822470504.
The previous prime is 3114422341307. The next prime is 3114422341363. The reversal of 3114422341323 is 3231432244113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3114422341323 - 24 = 3114422341307 is a prime.
It is a super-2 number, since 2×31144223413232 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3114422341363) 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 7 ways as a sum of consecutive naturals, for example, 364767615 + ... + 364776152.
It is an arithmetic number, because the mean of its divisors is an integer number (519435162816).
Almost surely, 23114422341323 is an apocalyptic number.
3114422341323 is a deficient number, since it is larger than the sum of its proper divisors (1041058961205).
3114422341323 is a wasteful number, since it uses less digits than its factorization.
3114422341323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729545193.
The product of its digits is 41472, while the sum is 33.
Adding to 3114422341323 its reverse (3231432244113), we get a palindrome (6345854585436).
The spelling of 3114422341323 in words is "three trillion, one hundred fourteen billion, four hundred twenty-two million, three hundred forty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •