Base | Representation |
---|---|
bin | 1100010010100101000111… |
… | …1101111010111111011011 |
3 | 1202211212022001121022110211 |
4 | 3010221101331322333123 |
5 | 3232400311112100443 |
6 | 44423535503351551 |
7 | 2563210135223161 |
oct | 304512175727733 |
9 | 52755261538424 |
10 | 13513342300123 |
11 | 433aa81488806 |
12 | 1622b86bb25b7 |
13 | 7703c2096423 |
14 | 34a099239231 |
15 | 1867a67d419d |
hex | c4a51f7afdb |
13513342300123 has 4 divisors (see below), whose sum is σ = 13514028938488. Its totient is φ = 13512655661760.
The previous prime is 13513342299959. The next prime is 13513342300141. The reversal of 13513342300123 is 32100324331531.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13513342300123 - 213 = 13513342291931 is a prime.
It is a super-2 number, since 2×135133423001232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13513342300153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343289661 + ... + 343329022.
It is an arithmetic number, because the mean of its divisors is an integer number (3378507234622).
Almost surely, 213513342300123 is an apocalyptic number.
13513342300123 is a deficient number, since it is larger than the sum of its proper divisors (686638365).
13513342300123 is an equidigital number, since it uses as much as digits as its factorization.
13513342300123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686638364.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 13513342300123 its reverse (32100324331531), we get a palindrome (45613666631654).
The spelling of 13513342300123 in words is "thirteen trillion, five hundred thirteen billion, three hundred forty-two million, three hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •