Base | Representation |
---|---|
bin | 101101010011111000010… |
… | …000100001000010000100 |
3 | 102000200001121011000221111 |
4 | 231103320100201002010 |
5 | 402003400134321401 |
6 | 10342231315454404 |
7 | 440646630135400 |
oct | 55237020410204 |
9 | 12020047130844 |
10 | 3113721401476 |
11 | aa05816138a4 |
12 | 423562bb7404 |
13 | 1978130049ca |
14 | aa9c242c100 |
15 | 55edd3cde51 |
hex | 2d4f8421084 |
3113721401476 has 27 divisors (see below), whose sum is σ = 6338697429477. Its totient is φ = 1334441441760.
The previous prime is 3113721401473. The next prime is 3113721401477. The reversal of 3113721401476 is 6741041273113.
It is a happy number.
The square root of 3113721401476 is 1764574.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3112140543876 + 1580857600 = 1764126^2 + 39760^2 .
It is not an unprimeable number, because it can be changed into a prime (3113721401473) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 24641016 + ... + 24767056.
Almost surely, 23113721401476 is an apocalyptic number.
3113721401476 is the 1764574-th square number.
It is an amenable number.
3113721401476 is an abundant number, since it is smaller than the sum of its proper divisors (3224976028001).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3113721401476 is an frugal number, since it uses more digits than its factorization.
3113721401476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252100 (or 126050 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 40.
Adding to 3113721401476 its reverse (6741041273113), we get a palindrome (9854762674589).
The spelling of 3113721401476 in words is "three trillion, one hundred thirteen billion, seven hundred twenty-one million, four hundred one thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •