Base | Representation |
---|---|
bin | 1100000010000111100100… |
… | …0010101100011111000001 |
3 | 1201211211022101101222201000 |
4 | 3000201321002230133001 |
5 | 3213232111141140223 |
6 | 44050004355002213 |
7 | 2533605603426033 |
oct | 300417102543701 |
9 | 51754271358630 |
10 | 13230530021313 |
11 | 4241044306870 |
12 | 15981b9899369 |
13 | 74c831106357 |
14 | 33a50aabdc53 |
15 | 17e25302d543 |
hex | c08790ac7c1 |
13230530021313 has 16 divisors (see below), whose sum is σ = 21382674782400. Its totient is φ = 8018503043040.
The previous prime is 13230530021287. The next prime is 13230530021323. The reversal of 13230530021313 is 31312003503231.
13230530021313 is a `hidden beast` number, since 1 + 3 + 2 + 305 + 300 + 21 + 31 + 3 = 666.
It is not a de Polignac number, because 13230530021313 - 210 = 13230530020289 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13230530021323) 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, 22273619268 + ... + 22273619861.
It is an arithmetic number, because the mean of its divisors is an integer number (1336417173900).
Almost surely, 213230530021313 is an apocalyptic number.
It is an amenable number.
13230530021313 is a deficient number, since it is larger than the sum of its proper divisors (8152144761087).
13230530021313 is a wasteful number, since it uses less digits than its factorization.
13230530021313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44547239149 (or 44547239143 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 27.
Adding to 13230530021313 its reverse (31312003503231), we get a palindrome (44542533524544).
The spelling of 13230530021313 in words is "thirteen trillion, two hundred thirty billion, five hundred thirty million, twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •