Base | Representation |
---|---|
bin | 1011111100000000000101… |
… | …1111100111010001001111 |
3 | 1201110210001211121221200220 |
4 | 2333000001133213101033 |
5 | 3210021402422333403 |
6 | 43525425104522423 |
7 | 2523165523500420 |
oct | 277000137472117 |
9 | 51423054557626 |
10 | 13125445121103 |
11 | 42005196559a7 |
12 | 157b971020413 |
13 | 742954cb0423 |
14 | 3353bc5bb647 |
15 | 17b6526bb953 |
hex | bf0017e744f |
13125445121103 has 8 divisors (see below), whose sum is σ = 20000678279808. Its totient is φ = 7500254354904.
The previous prime is 13125445121093. The next prime is 13125445121119. The reversal of 13125445121103 is 30112154452131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13125445121103 - 221 = 13125443023951 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13125445121143) 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 7 ways as a sum of consecutive naturals, for example, 312510598101 + ... + 312510598142.
It is an arithmetic number, because the mean of its divisors is an integer number (2500084784976).
Almost surely, 213125445121103 is an apocalyptic number.
13125445121103 is a deficient number, since it is larger than the sum of its proper divisors (6875233158705).
13125445121103 is an equidigital number, since it uses as much as digits as its factorization.
13125445121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625021196253.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 13125445121103 its reverse (30112154452131), we get a palindrome (43237599573234).
The spelling of 13125445121103 in words is "thirteen trillion, one hundred twenty-five billion, four hundred forty-five million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •