Base | Representation |
---|---|
bin | 101111001100010010011… |
… | …110100001100010001001 |
3 | 102111000202222000120210010 |
4 | 233030102132201202021 |
5 | 411113141114100131 |
6 | 10521452433342133 |
7 | 453204550503621 |
oct | 57142236414211 |
9 | 12430688016703 |
10 | 3243010300041 |
11 | 1040397850996 |
12 | 444625707949 |
13 | 1a6a78781155 |
14 | b2d692ad881 |
15 | 59558acab46 |
hex | 2f3127a1889 |
3243010300041 has 12 divisors (see below), whose sum is σ = 4426910768688. Its totient is φ = 2111727633624.
The previous prime is 3243010300037. The next prime is 3243010300093. The reversal of 3243010300041 is 1400030103423.
It is not a de Polignac number, because 3243010300041 - 22 = 3243010300037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3243010299990 and 3243010300017.
It is not an unprimeable number, because it can be changed into a prime (3243000300041) 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 11 ways as a sum of consecutive naturals, for example, 292315555 + ... + 292326648.
It is an arithmetic number, because the mean of its divisors is an integer number (368909230724).
Almost surely, 23243010300041 is an apocalyptic number.
It is an amenable number.
3243010300041 is a deficient number, since it is larger than the sum of its proper divisors (1183900468647).
3243010300041 is an equidigital number, since it uses as much as digits as its factorization.
3243010300041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584642292 (or 584642249 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 3243010300041 its reverse (1400030103423), we get a palindrome (4643040403464).
The spelling of 3243010300041 in words is "three trillion, two hundred forty-three billion, ten million, three hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •