Base | Representation |
---|---|
bin | 10011000101000011110… |
… | …110010010101011011000 |
3 | 11122100012001020002222211 |
4 | 103011003312102223120 |
5 | 132440114423043112 |
6 | 2442151302324504 |
7 | 163503235302025 |
oct | 23050366225330 |
9 | 4570161202884 |
10 | 1311103331032 |
11 | 466043717130 |
12 | 192125a29734 |
13 | 968375607c1 |
14 | 4765a07654c |
15 | 24188ac60a7 |
hex | 13143d92ad8 |
1311103331032 has 32 divisors (see below), whose sum is σ = 2682094576320. Its totient is φ = 595891102240.
The previous prime is 1311103330951. The next prime is 1311103331077. The reversal of 1311103331032 is 2301333011131.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 1311103330994 and 1311103331012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4623 + ... + 1619329.
It is an arithmetic number, because the mean of its divisors is an integer number (83815455510).
Almost surely, 21311103331032 is an apocalyptic number.
It is an amenable number.
1311103331032 is an abundant number, since it is smaller than the sum of its proper divisors (1370991245288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311103331032 is a wasteful number, since it uses less digits than its factorization.
1311103331032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1623951 (or 1623947 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1311103331032 its reverse (2301333011131), we get a palindrome (3612436342163).
The spelling of 1311103331032 in words is "one trillion, three hundred eleven billion, one hundred three million, three hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •