Base | Representation |
---|---|
bin | 100100011000101101011… |
… | …111101010110111000101 |
3 | 22212001001120011101122011 |
4 | 210120231133222313011 |
5 | 311431342131234023 |
6 | 5152403355334221 |
7 | 345436043246140 |
oct | 44305537526705 |
9 | 8761046141564 |
10 | 2500434243013 |
11 | 884478a42503 |
12 | 344726451371 |
13 | 151a36652a75 |
14 | 8904362d057 |
15 | 45096cda50d |
hex | 2462d7eadc5 |
2500434243013 has 16 divisors (see below), whose sum is σ = 2906329345920. Its totient is φ = 2106718084800.
The previous prime is 2500434242941. The next prime is 2500434243017. The reversal of 2500434243013 is 3103424340052.
It is a happy number.
It is not a de Polignac number, because 2500434243013 - 241 = 301410987461 is a prime.
It is a super-3 number, since 3×25004342430133 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2500434243017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4538983 + ... + 5059963.
It is an arithmetic number, because the mean of its divisors is an integer number (181645584120).
Almost surely, 22500434243013 is an apocalyptic number.
It is an amenable number.
2500434243013 is a deficient number, since it is larger than the sum of its proper divisors (405895102907).
2500434243013 is a wasteful number, since it uses less digits than its factorization.
2500434243013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532668.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 2500434243013 its reverse (3103424340052), we get a palindrome (5603858583065).
The spelling of 2500434243013 in words is "two trillion, five hundred billion, four hundred thirty-four million, two hundred forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •