Base | Representation |
---|---|
bin | 1100000110110001100011… |
… | …0101011001100110110000 |
3 | 1202010110210001020021022102 |
4 | 3001230120311121212300 |
5 | 3221034421144131000 |
6 | 44150434004155532 |
7 | 2542440046540325 |
oct | 301543065314660 |
9 | 52113701207272 |
10 | 13310520302000 |
11 | 4271a61784659 |
12 | 15ab802398ba8 |
13 | 75723b21729c |
14 | 340338448b4c |
15 | 18138572c3d5 |
hex | c1b18d599b0 |
13310520302000 has 160 divisors (see below), whose sum is σ = 33898062242304. Its totient is φ = 5045123424000.
The previous prime is 13310520301997. The next prime is 13310520302083. The reversal of 13310520302000 is 20302501331.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3569855 + ... + 6274145.
Almost surely, 213310520302000 is an apocalyptic number.
13310520302000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13310520302000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16949031121152).
13310520302000 is an abundant number, since it is smaller than the sum of its proper divisors (20587541940304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13310520302000 is a wasteful number, since it uses less digits than its factorization.
13310520302000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2704444 (or 2704428 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 13310520302000 its reverse (20302501331), we get a palindrome (13330822803331).
The spelling of 13310520302000 in words is "thirteen trillion, three hundred ten billion, five hundred twenty million, three hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •