Base | Representation |
---|---|
bin | 11101111111000110101… |
… | …01110100011001101000 |
3 | 10122111102011112121021221 |
4 | 32333203111310121220 |
5 | 113340034200101212 |
6 | 2105152443311424 |
7 | 134303034550465 |
oct | 16774325643150 |
9 | 3574364477257 |
10 | 1030311331432 |
11 | 367a52982929 |
12 | 14782121b574 |
13 | 76208cc8306 |
14 | 37c1dd7466c |
15 | 1bc0288b807 |
hex | efe3574668 |
1030311331432 has 8 divisors (see below), whose sum is σ = 1931833746450. Its totient is φ = 515155665712.
The previous prime is 1030311331403. The next prime is 1030311331541. The reversal of 1030311331432 is 2341331130301.
It can be written as a sum of positive squares in only one way, i.e., 1020314131236 + 9997200196 = 1010106^2 + 99986^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-3 number, since 3×10303113314323 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030311331397 and 1030311331406.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 64394458207 + ... + 64394458222.
Almost surely, 21030311331432 is an apocalyptic number.
It is an amenable number.
1030311331432 is a deficient number, since it is larger than the sum of its proper divisors (901522415018).
1030311331432 is a wasteful number, since it uses less digits than its factorization.
1030311331432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128788916435 (or 128788916431 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1030311331432 its reverse (2341331130301), we get a palindrome (3371642461733).
The spelling of 1030311331432 in words is "one trillion, thirty billion, three hundred eleven million, three hundred thirty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •