Base | Representation |
---|---|
bin | 110010000001101010… |
… | …111101110100101010 |
3 | 12010122111111102012212 |
4 | 302001222331310222 |
5 | 1340002033203230 |
6 | 40402033405122 |
7 | 3611053041323 |
oct | 620152756452 |
9 | 163574442185 |
10 | 53715131690 |
11 | 20864878520 |
12 | a4b11097a2 |
13 | 50b0660bbc |
14 | 2857ccd44a |
15 | 15e5ae9895 |
hex | c81abdd2a |
53715131690 has 64 divisors (see below), whose sum is σ = 106207718400. Its totient is φ = 19397898240.
The previous prime is 53715131689. The next prime is 53715131713. The reversal of 53715131690 is 9613151735.
53715131690 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×537151316902 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11011532 + ... + 11016408.
It is an arithmetic number, because the mean of its divisors is an integer number (1659495600).
Almost surely, 253715131690 is an apocalyptic number.
53715131690 is a deficient number, since it is larger than the sum of its proper divisors (52492586710).
53715131690 is a wasteful number, since it uses less digits than its factorization.
53715131690 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5567.
The product of its (nonzero) digits is 85050, while the sum is 41.
The spelling of 53715131690 in words is "fifty-three billion, seven hundred fifteen million, one hundred thirty-one thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •