Base | Representation |
---|---|
bin | 100101101000011100100011… |
… | …0100000001000101101101111 |
3 | 1121102000122210120020120112221 |
4 | 1023100321012200020231233 |
5 | 321341314302424112033 |
6 | 3132001513100540211 |
7 | 126502665144555226 |
oct | 11320710640105557 |
9 | 1542018716216487 |
10 | 331014312332143 |
11 | 96520421871440 |
12 | 3116095b551667 |
13 | 1129169204678b |
14 | 5ba526cda5cbd |
15 | 284069662a12d |
hex | 12d0e46808b6f |
331014312332143 has 16 divisors (see below), whose sum is σ = 362691876867840. Its totient is φ = 299602138060800.
The previous prime is 331014312332069. The next prime is 331014312332203. The reversal of 331014312332143 is 341233213410133.
It is a cyclic number.
It is not a de Polignac number, because 331014312332143 - 233 = 331005722397551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331014312332099 and 331014312332108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331014312392143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23427363 + ... + 34797556.
It is an arithmetic number, because the mean of its divisors is an integer number (22668242304240).
Almost surely, 2331014312332143 is an apocalyptic number.
331014312332143 is a deficient number, since it is larger than the sum of its proper divisors (31677564535697).
331014312332143 is a wasteful number, since it uses less digits than its factorization.
331014312332143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58227198.
The product of its (nonzero) digits is 46656, while the sum is 34.
Adding to 331014312332143 its reverse (341233213410133), we get a palindrome (672247525742276).
The spelling of 331014312332143 in words is "three hundred thirty-one trillion, fourteen billion, three hundred twelve million, three hundred thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •