Base | Representation |
---|---|
bin | 110001100100010001010… |
… | …110011010000111001000 |
3 | 110001121222221112000202110 |
4 | 301210101112122013020 |
5 | 421301344214340040 |
6 | 11124441534302320 |
7 | 501042546404364 |
oct | 61442126320710 |
9 | 13047887460673 |
10 | 3406200152520 |
11 | 10a361a206470 |
12 | 4701896579a0 |
13 | 1b9284845839 |
14 | bac0a6ca2a4 |
15 | 5d90a60e980 |
hex | 3191159a1c8 |
3406200152520 has 128 divisors (see below), whose sum is σ = 11148136064640. Its totient is φ = 825703127040.
The previous prime is 3406200152507. The next prime is 3406200152557. The reversal of 3406200152520 is 252510026043.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 31299642 + ... + 31408278.
It is an arithmetic number, because the mean of its divisors is an integer number (87094813005).
Almost surely, 23406200152520 is an apocalyptic number.
3406200152520 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3406200152520 is an abundant number, since it is smaller than the sum of its proper divisors (7741935912120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3406200152520 is a wasteful number, since it uses less digits than its factorization.
3406200152520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132415 (or 132411 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 3406200152520 its reverse (252510026043), we get a palindrome (3658710178563).
The spelling of 3406200152520 in words is "three trillion, four hundred six billion, two hundred million, one hundred fifty-two thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •