Base | Representation |
---|---|
bin | 110001101100000010101… |
… | …100011110001000010111 |
3 | 110002102112110100012020002 |
4 | 301230002230132020113 |
5 | 421420441304300003 |
6 | 11132341524401515 |
7 | 501456405632024 |
oct | 61540254361027 |
9 | 13072473305202 |
10 | 3414544212503 |
11 | 10a7111211206 |
12 | 471917b4629b |
13 | 1b9cb4442238 |
14 | bb39c95654b |
15 | 5dc47e1da88 |
hex | 31b02b1e217 |
3414544212503 has 16 divisors (see below), whose sum is σ = 3469092157440. Its totient is φ = 3360552908736.
The previous prime is 3414544212473. The next prime is 3414544212509. The reversal of 3414544212503 is 3052124454143.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3414544212503 is a prime.
It is a super-2 number, since 2×34145442125032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3414544212509) 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 15 ways as a sum of consecutive naturals, for example, 7119626 + ... + 7584072.
It is an arithmetic number, because the mean of its divisors is an integer number (216818259840).
Almost surely, 23414544212503 is an apocalyptic number.
3414544212503 is a deficient number, since it is larger than the sum of its proper divisors (54547944937).
3414544212503 is a wasteful number, since it uses less digits than its factorization.
3414544212503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465046.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 3414544212503 its reverse (3052124454143), we get a palindrome (6466668666646).
The spelling of 3414544212503 in words is "three trillion, four hundred fourteen billion, five hundred forty-four million, two hundred twelve thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •