Base | Representation |
---|---|
bin | 1011011000110001000000… |
… | …1100010000001000011111 |
3 | 1122022220120101110102110221 |
4 | 2312030100030100020133 |
5 | 3120112131414040403 |
6 | 42343353302142211 |
7 | 2431355532156154 |
oct | 266142014201037 |
9 | 48286511412427 |
10 | 12520101315103 |
11 | 3a97821880908 |
12 | 14a2590721967 |
13 | 6ca8431c9545 |
14 | 313d9473c22b |
15 | 16aa23633dbd |
hex | b631031021f |
12520101315103 has 8 divisors (see below), whose sum is σ = 12599974310000. Its totient is φ = 12440447451648.
The previous prime is 12520101315097. The next prime is 12520101315151. The reversal of 12520101315103 is 30151310102521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12520101315103 - 237 = 12382662361631 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12520101315173) 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, 54668226 + ... + 54896767.
It is an arithmetic number, because the mean of its divisors is an integer number (1574996788750).
Almost surely, 212520101315103 is an apocalyptic number.
12520101315103 is a deficient number, since it is larger than the sum of its proper divisors (79872994897).
12520101315103 is a wasteful number, since it uses less digits than its factorization.
12520101315103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109565721.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 12520101315103 its reverse (30151310102521), we get a palindrome (42671411417624).
The spelling of 12520101315103 in words is "twelve trillion, five hundred twenty billion, one hundred one million, three hundred fifteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •