Base | Representation |
---|---|
bin | 101101010011001111101… |
… | …011010000000100000000 |
3 | 102000121022010222220001221 |
4 | 231103033223100010000 |
5 | 402001001334402000 |
6 | 10342035554404424 |
7 | 440624022012232 |
oct | 55231753200400 |
9 | 12017263886057 |
10 | 3113040544000 |
11 | aa0262259572 |
12 | 4233b2b90714 |
13 | 197734c3866a |
14 | aa959c38252 |
15 | 55e9d73d61a |
hex | 2d4cfad0100 |
3113040544000 has 144 divisors (see below), whose sum is σ = 8211149449776. Its totient is φ = 1171968000000.
The previous prime is 3113040543997. The next prime is 3113040544037. The reversal of 3113040544000 is 4450403113.
It can be written as a sum of positive squares in 8 ways, for example, as 963978366976 + 2149062177024 = 981824^2 + 1465968^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2317251 + ... + 3405250.
It is an arithmetic number, because the mean of its divisors is an integer number (57021871179).
Almost surely, 23113040544000 is an apocalyptic number.
It is an amenable number.
3113040544000 is an abundant number, since it is smaller than the sum of its proper divisors (5098108905776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3113040544000 is an equidigital number, since it uses as much as digits as its factorization.
3113040544000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5722549 (or 5722525 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 3113040544000 its reverse (4450403113), we get a palindrome (3117490947113).
The spelling of 3113040544000 in words is "three trillion, one hundred thirteen billion, forty million, five hundred forty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •