Base | Representation |
---|---|
bin | 11000001111001001… |
… | …11001000001000001 |
3 | 1020120211101202100220 |
4 | 30013210321001001 |
5 | 203122033404441 |
6 | 5551100333253 |
7 | 640310200212 |
oct | 140744710101 |
9 | 36524352326 |
10 | 13012013121 |
11 | 5577a40058 |
12 | 2631844229 |
13 | 12c4a19963 |
14 | 8b61b5409 |
15 | 512526466 |
hex | 307939041 |
13012013121 has 8 divisors (see below), whose sum is σ = 17718486144. Its totient is φ = 8490107760.
The previous prime is 13012013107. The next prime is 13012013137. The reversal of 13012013121 is 12131021031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13012013121 - 25 = 13012013089 is a prime.
It is a super-2 number, since 2×130120131212 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13012013121.
It is not an unprimeable number, because it can be changed into a prime (13012013171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46141750 + ... + 46142031.
It is an arithmetic number, because the mean of its divisors is an integer number (2214810768).
Almost surely, 213012013121 is an apocalyptic number.
It is an amenable number.
13012013121 is a deficient number, since it is larger than the sum of its proper divisors (4706473023).
13012013121 is an equidigital number, since it uses as much as digits as its factorization.
13012013121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92283831.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13012013121 its reverse (12131021031), we get a palindrome (25143034152).
The spelling of 13012013121 in words is "thirteen billion, twelve million, thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •