Base | Representation |
---|---|
bin | 101101010011011001110… |
… | …101100000000010100000 |
3 | 102000121202000202002220201 |
4 | 231103121311200002200 |
5 | 402001324004044130 |
6 | 10342104524114544 |
7 | 440631161622325 |
oct | 55233165400240 |
9 | 12017660662821 |
10 | 3113211003040 |
11 | aa033a4a4a06 |
12 | 423440095a54 |
13 | 19776134b8b8 |
14 | aa97472ab4c |
15 | 55ead6aebca |
hex | 2d4d9d600a0 |
3113211003040 has 48 divisors (see below), whose sum is σ = 7553743738632. Its totient is φ = 1211628063744.
The previous prime is 3113211002987. The next prime is 3113211003041. The reversal of 3113211003040 is 403001123113.
It can be written as a sum of positive squares in 4 ways, for example, as 2623272601104 + 489938401936 = 1619652^2 + 699956^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3113211002999 and 3113211003017.
It is not an unprimeable number, because it can be changed into a prime (3113211003041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262934199 + ... + 262946038.
Almost surely, 23113211003040 is an apocalyptic number.
It is an amenable number.
3113211003040 is an abundant number, since it is smaller than the sum of its proper divisors (4440532735592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3113211003040 is a wasteful number, since it uses less digits than its factorization.
3113211003040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525880289 (or 525880281 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3113211003040 its reverse (403001123113), we get a palindrome (3516212126153).
The spelling of 3113211003040 in words is "three trillion, one hundred thirteen billion, two hundred eleven million, three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •