Base | Representation |
---|---|
bin | 110010010001000001100… |
… | …101010111111001100001 |
3 | 110020020000220100112112002 |
4 | 302101001211113321201 |
5 | 423043303012202431 |
6 | 11202510135413345 |
7 | 504363430511051 |
oct | 62210145277141 |
9 | 13206026315462 |
10 | 3454254022241 |
11 | 1111a39385a90 |
12 | 47955a824255 |
13 | 1c097234ca89 |
14 | bd288785561 |
15 | 5ecbe1d33cb |
hex | 32441957e61 |
3454254022241 has 16 divisors (see below), whose sum is σ = 3995310676608. Its totient is φ = 2951533536000.
The previous prime is 3454254022129. The next prime is 3454254022253. The reversal of 3454254022241 is 1422204524543.
It is a cyclic number.
It is not a de Polignac number, because 3454254022241 - 238 = 3179376115297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3454254022195 and 3454254022204.
It is not an unprimeable number, because it can be changed into a prime (3454254022841) 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, 12291710 + ... + 12569591.
It is an arithmetic number, because the mean of its divisors is an integer number (249706917288).
Almost surely, 23454254022241 is an apocalyptic number.
It is an amenable number.
3454254022241 is a deficient number, since it is larger than the sum of its proper divisors (541056654367).
3454254022241 is a wasteful number, since it uses less digits than its factorization.
3454254022241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24862072.
The product of its (nonzero) digits is 307200, while the sum is 38.
Adding to 3454254022241 its reverse (1422204524543), we get a palindrome (4876458546784).
The spelling of 3454254022241 in words is "three trillion, four hundred fifty-four billion, two hundred fifty-four million, twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •