Base | Representation |
---|---|
bin | 100101101001011000001100… |
… | …1011000100110011111001111 |
3 | 1121102110220102112001212211011 |
4 | 1023102300121120212133033 |
5 | 321400414121011313403 |
6 | 3132140415342310051 |
7 | 126515151323311351 |
oct | 11322603130463717 |
9 | 1542426375055734 |
10 | 331142404401103 |
11 | 9656a783468759 |
12 | 31181749288327 |
13 | 112a079686b819 |
14 | 5bab540d010d1 |
15 | 2843b91c15a6d |
hex | 12d2c196267cf |
331142404401103 has 16 divisors (see below), whose sum is σ = 342677702638656. Its totient is φ = 319787452258560.
The previous prime is 331142404401047. The next prime is 331142404401113. The reversal of 331142404401103 is 301104404241133.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-331142404401103 is a prime.
It is a super-3 number, since 3×3311424044011033 (a number of 45 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331142404401113) 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, 96108576 + ... + 99494437.
It is an arithmetic number, because the mean of its divisors is an integer number (21417356414916).
Almost surely, 2331142404401103 is an apocalyptic number.
331142404401103 is a deficient number, since it is larger than the sum of its proper divisors (11535298237553).
331142404401103 is a wasteful number, since it uses less digits than its factorization.
331142404401103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195603474.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 331142404401103 its reverse (301104404241133), we get a palindrome (632246808642236).
The spelling of 331142404401103 in words is "three hundred thirty-one trillion, one hundred forty-two billion, four hundred four million, four hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •