Base | Representation |
---|---|
bin | 101111001100101100101… |
… | …100000000010001000011 |
3 | 102111001220121110202112112 |
4 | 233030230230000101003 |
5 | 411120041202311121 |
6 | 10522004222445535 |
7 | 453221500315466 |
oct | 57145454002103 |
9 | 12431817422475 |
10 | 3243450041411 |
11 | 10405a2aa0108 |
12 | 444728a338ab |
13 | 1a6b188c8648 |
14 | b2dab85b2dd |
15 | 595824de75b |
hex | 2f32cb00443 |
3243450041411 has 4 divisors (see below), whose sum is σ = 3243559340712. Its totient is φ = 3243340742112.
The previous prime is 3243450041389. The next prime is 3243450041413. The reversal of 3243450041411 is 1141400543423.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3243450041411 - 230 = 3242376299587 is a prime.
It is a super-2 number, since 2×32434500414112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3243450041413) 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 3 ways as a sum of consecutive naturals, for example, 54605126 + ... + 54664491.
It is an arithmetic number, because the mean of its divisors is an integer number (810889835178).
Almost surely, 23243450041411 is an apocalyptic number.
3243450041411 is a deficient number, since it is larger than the sum of its proper divisors (109299301).
3243450041411 is a wasteful number, since it uses less digits than its factorization.
3243450041411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109299300.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 3243450041411 its reverse (1141400543423), we get a palindrome (4384850584834).
The spelling of 3243450041411 in words is "three trillion, two hundred forty-three billion, four hundred fifty million, forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •