Base | Representation |
---|---|
bin | 1100000110001111010111… |
… | …1000101100111000001111 |
3 | 1202002121002112110100212202 |
4 | 3001203311320230320033 |
5 | 3220412123032431343 |
6 | 44142315244552115 |
7 | 2541663463526354 |
oct | 301436570547017 |
9 | 52077075410782 |
10 | 13301344030223 |
11 | 4269082a37877 |
12 | 15a9a8125263b |
13 | 75640809a082 |
14 | 33db0786a62b |
15 | 180ee9d31db8 |
hex | c18f5e2ce0f |
13301344030223 has 8 divisors (see below), whose sum is σ = 13307594582016. Its totient is φ = 13295094345400.
The previous prime is 13301344030199. The next prime is 13301344030291. The reversal of 13301344030223 is 32203044310331.
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 13301344030223 - 218 = 13301343768079 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 (13301344030523) 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, 31564118 + ... + 31982748.
It is an arithmetic number, because the mean of its divisors is an integer number (1663449322752).
Almost surely, 213301344030223 is an apocalyptic number.
13301344030223 is a deficient number, since it is larger than the sum of its proper divisors (6250551793).
13301344030223 is a wasteful number, since it uses less digits than its factorization.
13301344030223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433485.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 13301344030223 its reverse (32203044310331), we get a palindrome (45504388340554).
The spelling of 13301344030223 in words is "thirteen trillion, three hundred one billion, three hundred forty-four million, thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •