Base | Representation |
---|---|
bin | 1100001001001010000010… |
… | …0000011000101011010101 |
3 | 1202021101102120221100002111 |
4 | 3002102200200120223111 |
5 | 3222222233001401323 |
6 | 44221323315311021 |
7 | 2545416256456150 |
oct | 302224040305325 |
9 | 52241376840074 |
10 | 13351451200213 |
11 | 4288356149265 |
12 | 15b7725bab471 |
13 | 75b0620c0c99 |
14 | 3422dc4d6c97 |
15 | 18247dce5c0d |
hex | c24a0818ad5 |
13351451200213 has 8 divisors (see below), whose sum is σ = 15401406992832. Its totient is φ = 11337146812896.
The previous prime is 13351451200207. The next prime is 13351451200277. The reversal of 13351451200213 is 31200215415331.
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 13351451200213 - 25 = 13351451200181 is a prime.
It is a super-2 number, since 2×133514512002132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13351451240213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8912850520 + ... + 8912852017.
It is an arithmetic number, because the mean of its divisors is an integer number (1925175874104).
Almost surely, 213351451200213 is an apocalyptic number.
It is an amenable number.
13351451200213 is a deficient number, since it is larger than the sum of its proper divisors (2049955792619).
13351451200213 is a wasteful number, since it uses less digits than its factorization.
13351451200213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17825702651.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 13351451200213 its reverse (31200215415331), we get a palindrome (44551666615544).
The spelling of 13351451200213 in words is "thirteen trillion, three hundred fifty-one billion, four hundred fifty-one million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •