Base | Representation |
---|---|
bin | 100101101010000001001000… |
… | …0111101111101111100000111 |
3 | 1121102210022022211000120102112 |
4 | 1023110002100331331330013 |
5 | 321403334133331443421 |
6 | 3132245034225131235 |
7 | 126524412601660061 |
oct | 11324022075757407 |
9 | 1542708284016375 |
10 | 331230310031111 |
11 | 965a3a92946657 |
12 | 311967a0789b1b |
13 | 112a8b657c46ca |
14 | 5bb18bd9ba731 |
15 | 28460d928d45b |
hex | 12d4090f7df07 |
331230310031111 has 32 divisors (see below), whose sum is σ = 379786344468480. Its totient is φ = 287184116620800.
The previous prime is 331230310031063. The next prime is 331230310031129. The reversal of 331230310031111 is 111130013032133.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-331230310031111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331230310031141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 151542521 + ... + 153712706.
It is an arithmetic number, because the mean of its divisors is an integer number (11868323264640).
Almost surely, 2331230310031111 is an apocalyptic number.
331230310031111 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
331230310031111 is a deficient number, since it is larger than the sum of its proper divisors (48556034437369).
331230310031111 is a wasteful number, since it uses less digits than its factorization.
331230310031111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305255375.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 331230310031111 its reverse (111130013032133), we get a palindrome (442360323063244).
The spelling of 331230310031111 in words is "three hundred thirty-one trillion, two hundred thirty billion, three hundred ten million, thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •