Base | Representation |
---|---|
bin | 110011001000000111110… |
… | …110110010101101000101 |
3 | 110102212201221021020121011 |
4 | 303020013312302231011 |
5 | 430030433223131401 |
6 | 11250012433522221 |
7 | 511556462123503 |
oct | 63100766625505 |
9 | 13385657236534 |
10 | 3513415052101 |
11 | 1135038225399 |
12 | 488b0b713371 |
13 | 1c6410031216 |
14 | c209ba47673 |
15 | 615d2e62451 |
hex | 33207db2b45 |
3513415052101 has 24 divisors (see below), whose sum is σ = 3775337979336. Its totient is φ = 3268645847040.
The previous prime is 3513415052093. The next prime is 3513415052123. The reversal of 3513415052101 is 1012505143153.
3513415052101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 254671622500 + 3258743429601 = 504650^2 + 1805199^2 .
It is not a de Polignac number, because 3513415052101 - 23 = 3513415052093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3513415059101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22938765 + ... + 23091421.
It is an arithmetic number, because the mean of its divisors is an integer number (157305749139).
Almost surely, 23513415052101 is an apocalyptic number.
It is an amenable number.
3513415052101 is a deficient number, since it is larger than the sum of its proper divisors (261922927235).
3513415052101 is a wasteful number, since it uses less digits than its factorization.
3513415052101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153609 (or 153592 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 3513415052101 in words is "three trillion, five hundred thirteen billion, four hundred fifteen million, fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •