Base | Representation |
---|---|
bin | 110001110001101011110… |
… | …010010111000110011111 |
3 | 110010000011122202112020122 |
4 | 301301223302113012133 |
5 | 422020343144102201 |
6 | 11135223015105155 |
7 | 502062500041466 |
oct | 61615362270637 |
9 | 13100148675218 |
10 | 3420602331551 |
11 | 10a973a928769 |
12 | 472b289721bb |
13 | 1ba73b579a72 |
14 | bb7b53739dd |
15 | 5de9ebd6e1b |
hex | 31c6bc9719f |
3420602331551 has 4 divisors (see below), whose sum is σ = 3428220600000. Its totient is φ = 3412984063104.
The previous prime is 3420602331541. The next prime is 3420602331557. The reversal of 3420602331551 is 1551332060243.
It is a happy number.
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 3420602331551 - 210 = 3420602330527 is a prime.
It is a super-2 number, since 2×34206023315512 (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 (3420602331557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3809133551 + ... + 3809134448.
It is an arithmetic number, because the mean of its divisors is an integer number (857055150000).
Almost surely, 23420602331551 is an apocalyptic number.
3420602331551 is a deficient number, since it is larger than the sum of its proper divisors (7618268449).
3420602331551 is an equidigital number, since it uses as much as digits as its factorization.
3420602331551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7618268448.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 3420602331551 its reverse (1551332060243), we get a palindrome (4971934391794).
The spelling of 3420602331551 in words is "three trillion, four hundred twenty billion, six hundred two million, three hundred thirty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •