Base | Representation |
---|---|
bin | 11001001101000010… |
… | …00101101110010100 |
3 | 1021221000011121211001 |
4 | 30212201011232110 |
5 | 210202431012132 |
6 | 10114402353044 |
7 | 656212353100 |
oct | 144641055624 |
9 | 37830147731 |
10 | 13531110292 |
11 | 5813a60487 |
12 | 275765b784 |
13 | 137842a24b |
14 | 9250dc900 |
15 | 542db2ce7 |
hex | 326845b94 |
13531110292 has 18 divisors (see below), whose sum is σ = 27545474922. Its totient is φ = 5799047184.
The previous prime is 13531110277. The next prime is 13531110293. The reversal of 13531110292 is 29201113531.
It can be written as a sum of positive squares in only one way, i.e., 11830042756 + 1701067536 = 108766^2 + 41244^2 .
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 13531110292.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13531110293) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 34517943 + ... + 34518334.
Almost surely, 213531110292 is an apocalyptic number.
It is an amenable number.
13531110292 is an abundant number, since it is smaller than the sum of its proper divisors (14014364630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13531110292 is a wasteful number, since it uses less digits than its factorization.
13531110292 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69036295 (or 69036286 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 28.
The spelling of 13531110292 in words is "thirteen billion, five hundred thirty-one million, one hundred ten thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •