Base | Representation |
---|---|
bin | 1001101001010100110… |
… | …11100100101101110101 |
3 | 1011200110112101120022021 |
4 | 10310222123210231311 |
5 | 20412224113300031 |
6 | 412130530033141 |
7 | 32642001343300 |
oct | 4645233445565 |
9 | 1150415346267 |
10 | 331424353141 |
11 | 118613452992 |
12 | 542954187b1 |
13 | 2533a31b0cb |
14 | 120807dbb37 |
15 | 894b38d511 |
hex | 4d2a6e4b75 |
331424353141 has 12 divisors (see below), whose sum is σ = 386850285612. Its totient is φ = 283108455168.
The previous prime is 331424353129. The next prime is 331424353147. The reversal of 331424353141 is 141353424133.
It can be written as a sum of positive squares in 2 ways, for example, as 182000358225 + 149423994916 = 426615^2 + 386554^2 .
It is not a de Polignac number, because 331424353141 - 29 = 331424352629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 331424353097 and 331424353106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331424353147) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11527900 + ... + 11556613.
It is an arithmetic number, because the mean of its divisors is an integer number (32237523801).
Almost surely, 2331424353141 is an apocalyptic number.
It is an amenable number.
331424353141 is a deficient number, since it is larger than the sum of its proper divisors (55425932471).
331424353141 is a wasteful number, since it uses less digits than its factorization.
331424353141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23084820 (or 23084813 counting only the distinct ones).
The product of its digits is 51840, while the sum is 34.
Adding to 331424353141 its reverse (141353424133), we get a palindrome (472777777274).
The spelling of 331424353141 in words is "three hundred thirty-one billion, four hundred twenty-four million, three hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •