Base | Representation |
---|---|
bin | 1110100111001000101101… |
… | …01001100000011101110011 |
3 | 11012202200210202012120210110 |
4 | 13103210112221200131303 |
5 | 13202413322230233021 |
6 | 152200442550432403 |
7 | 6524250612266046 |
oct | 723442651403563 |
9 | 135680722176713 |
10 | 32131030321011 |
11 | a268769a64436 |
12 | 372b261062703 |
13 | 14c0c3517043b |
14 | 7d12160a6c5d |
15 | 3aac062da476 |
hex | 1d3916a60773 |
32131030321011 has 8 divisors (see below), whose sum is σ = 42853153092304. Its totient is φ = 21414797215200.
The previous prime is 32131030320947. The next prime is 32131030321063. The reversal of 32131030321011 is 11012303013123.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32131030321011 - 26 = 32131030320947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32131030325011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1472403640 + ... + 1472425461.
It is an arithmetic number, because the mean of its divisors is an integer number (5356644136538).
Almost surely, 232131030321011 is an apocalyptic number.
32131030321011 is a deficient number, since it is larger than the sum of its proper divisors (10722122771293).
32131030321011 is a wasteful number, since it uses less digits than its factorization.
32131030321011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2944832741.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 32131030321011 its reverse (11012303013123), we get a palindrome (43143333334134).
The spelling of 32131030321011 in words is "thirty-two trillion, one hundred thirty-one billion, thirty million, three hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •