Base | Representation |
---|---|
bin | 11000010001110010… |
… | …01001111000011100 |
3 | 1020122100222000000122 |
4 | 30020321021320130 |
5 | 203143212233200 |
6 | 5553210014112 |
7 | 640666020152 |
oct | 141071117034 |
9 | 36570860018 |
10 | 13034102300 |
11 | 5589457a7a |
12 | 2639117338 |
13 | 12c9481c8b |
14 | 8b90c53d2 |
15 | 51443b385 |
hex | 308e49e1c |
13034102300 has 108 divisors (see below), whose sum is σ = 31353566160. Its totient is φ = 4693370880.
The previous prime is 13034102293. The next prime is 13034102309. The reversal of 13034102300 is 320143031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13034102309) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 654896 + ... + 674504.
Almost surely, 213034102300 is an apocalyptic number.
13034102300 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 13034102300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15676783080).
13034102300 is an abundant number, since it is smaller than the sum of its proper divisors (18319463860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13034102300 is a wasteful number, since it uses less digits than its factorization.
13034102300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19680 (or 19656 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 13034102300 its reverse (320143031), we get a palindrome (13354245331).
The spelling of 13034102300 in words is "thirteen billion, thirty-four million, one hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •