Base | Representation |
---|---|
bin | 11110000010101111101010… |
… | …100000000100001110100000 |
3 | 122022211111122210122002011012 |
4 | 132002233222200010032200 |
5 | 114304304231334420222 |
6 | 1145003405021040052 |
7 | 36555035621165630 |
oct | 3602575240041640 |
9 | 568744583562135 |
10 | 132130013201312 |
11 | 39112029914515 |
12 | 1299b8220b6028 |
13 | 5895a64663ab9 |
14 | 248b1abb926c0 |
15 | 10420116461e2 |
hex | 782bea8043a0 |
132130013201312 has 48 divisors (see below), whose sum is σ = 299923437102912. Its totient is φ = 56126023296000.
The previous prime is 132130013201311. The next prime is 132130013201401. The reversal of 132130013201312 is 213102310031231.
It is not an unprimeable number, because it can be changed into a prime (132130013201311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2610001814 + ... + 2610052437.
It is an arithmetic number, because the mean of its divisors is an integer number (6248404939644).
Almost surely, 2132130013201312 is an apocalyptic number.
It is an amenable number.
132130013201312 is an abundant number, since it is smaller than the sum of its proper divisors (167793423901600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132130013201312 is a wasteful number, since it uses less digits than its factorization.
132130013201312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5220054381 (or 5220054373 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 132130013201312 its reverse (213102310031231), we get a palindrome (345232323232543).
The spelling of 132130013201312 in words is "one hundred thirty-two trillion, one hundred thirty billion, thirteen million, two hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •