Base | Representation |
---|---|
bin | 1001101110001000011… |
… | …10001010111110110101 |
3 | 1011221010100110012002211 |
4 | 10313010032022332311 |
5 | 20433020124444000 |
6 | 413234540133421 |
7 | 33062641446136 |
oct | 4670416127665 |
9 | 1157110405084 |
10 | 334004531125 |
11 | 119717939891 |
12 | 54895537271 |
13 | 2565ba40945 |
14 | 1224735dc8d |
15 | 8a4cb557ba |
hex | 4dc438afb5 |
334004531125 has 16 divisors (see below), whose sum is σ = 431211371760. Its totient is φ = 257989704000.
The previous prime is 334004531101. The next prime is 334004531129. The reversal of 334004531125 is 521135400433.
It can be written as a sum of positive squares in 8 ways, for example, as 209918832561 + 124085698564 = 458169^2 + 352258^2 .
It is not a de Polignac number, because 334004531125 - 211 = 334004529077 is a prime.
It is a super-2 number, since 2×3340045311252 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (334004531129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46065966 + ... + 46073215.
It is an arithmetic number, because the mean of its divisors is an integer number (26950710735).
Almost surely, 2334004531125 is an apocalyptic number.
It is an amenable number.
334004531125 is a deficient number, since it is larger than the sum of its proper divisors (97206840635).
334004531125 is an equidigital number, since it uses as much as digits as its factorization.
334004531125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92139225 (or 92139215 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 334004531125 its reverse (521135400433), we get a palindrome (855139931558).
The spelling of 334004531125 in words is "three hundred thirty-four billion, four million, five hundred thirty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •