Base | Representation |
---|---|
bin | 10110001001100001011… |
… | …100100110111010000100 |
3 | 12101111200111211110200210 |
4 | 112021201130212322010 |
5 | 144414131121442012 |
6 | 3123115512435420 |
7 | 214651620455133 |
oct | 26114134467204 |
9 | 5344614743623 |
10 | 1522053312132 |
11 | 537554462191 |
12 | 206b986a8b70 |
13 | b06b5313422 |
14 | 5394c52791a |
15 | 298d350923c |
hex | 16261726e84 |
1522053312132 has 12 divisors (see below), whose sum is σ = 3551457728336. Its totient is φ = 507351104040.
The previous prime is 1522053312061. The next prime is 1522053312139. The reversal of 1522053312132 is 2312133502251.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 1522053312132.
It is not an unprimeable number, because it can be changed into a prime (1522053312139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63418887994 + ... + 63418888017.
Almost surely, 21522053312132 is an apocalyptic number.
1522053312132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1522053312132 is an abundant number, since it is smaller than the sum of its proper divisors (2029404416204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1522053312132 is a wasteful number, since it uses less digits than its factorization.
1522053312132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126837776018 (or 126837776016 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 1522053312132 its reverse (2312133502251), we get a palindrome (3834186814383).
The spelling of 1522053312132 in words is "one trillion, five hundred twenty-two billion, fifty-three million, three hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •