Base | Representation |
---|---|
bin | 110001110001001011010… |
… | …100001101100101000011 |
3 | 110002221202200200010111002 |
4 | 301301023110031211003 |
5 | 422013234213313230 |
6 | 11135052554442215 |
7 | 502043133403430 |
oct | 61611324154503 |
9 | 13087680603432 |
10 | 3420057557315 |
11 | 10a949036a823 |
12 | 4729b643336b |
13 | 1ba682749049 |
14 | bb762c84b87 |
15 | 5de6be77545 |
hex | 31c4b50d943 |
3420057557315 has 16 divisors (see below), whose sum is σ = 4690620072192. Its totient is φ = 2345054613984.
The previous prime is 3420057557311. The next prime is 3420057557377. The reversal of 3420057557315 is 5137557500243.
It is a cyclic number.
It is not a de Polignac number, because 3420057557315 - 22 = 3420057557311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3420057557315.
It is not an unprimeable number, because it can be changed into a prime (3420057557311) 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, 2006489 + ... + 3296378.
It is an arithmetic number, because the mean of its divisors is an integer number (293163754512).
Almost surely, 23420057557315 is an apocalyptic number.
3420057557315 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3420057557315 is a deficient number, since it is larger than the sum of its proper divisors (1270562514877).
3420057557315 is a wasteful number, since it uses less digits than its factorization.
3420057557315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5321306.
The product of its (nonzero) digits is 2205000, while the sum is 47.
The spelling of 3420057557315 in words is "three trillion, four hundred twenty billion, fifty-seven million, five hundred fifty-seven thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •