Base | Representation |
---|---|
bin | 1100000110011010011111… |
… | …1011111110101100000011 |
3 | 1202002212210201102001011120 |
4 | 3001212213323332230003 |
5 | 3220434232243442201 |
6 | 44143531515043323 |
7 | 2542130505405414 |
oct | 301464773765403 |
9 | 52085721361146 |
10 | 13304331234051 |
11 | 426a376158270 |
12 | 15aa575740543 |
13 | 756792c210c0 |
14 | 33dd0c4a180b |
15 | 1811221e9536 |
hex | c19a7efeb03 |
13304331234051 has 16 divisors (see below), whose sum is σ = 20840351024640. Its totient is φ = 7442982508320.
The previous prime is 13304331233927. The next prime is 13304331234071. The reversal of 13304331234051 is 15043213340331.
It is a happy number.
It is not a de Polignac number, because 13304331234051 - 218 = 13304330971907 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (13304331234071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15506213131 + ... + 15506213988.
It is an arithmetic number, because the mean of its divisors is an integer number (1302521939040).
Almost surely, 213304331234051 is an apocalyptic number.
13304331234051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13304331234051 is a deficient number, since it is larger than the sum of its proper divisors (7536019790589).
13304331234051 is a wasteful number, since it uses less digits than its factorization.
13304331234051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31012427146.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 13304331234051 its reverse (15043213340331), we get a palindrome (28347544574382).
The spelling of 13304331234051 in words is "thirteen trillion, three hundred four billion, three hundred thirty-one million, two hundred thirty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •