Base | Representation |
---|---|
bin | 11000001110111101… |
… | …01110101100110000 |
3 | 1020120201100200211121 |
4 | 30013132232230300 |
5 | 203121130214000 |
6 | 5551001552024 |
7 | 640260362335 |
oct | 140736565460 |
9 | 36521320747 |
10 | 13010398000 |
11 | 5577037646 |
12 | 26311a5614 |
13 | 12c45a2772 |
14 | 8b5cb498c |
15 | 512307b1a |
hex | 3077aeb30 |
13010398000 has 40 divisors (see below), whose sum is σ = 31459147200. Its totient is φ = 5204158400.
The previous prime is 13010397973. The next prime is 13010398001. The reversal of 13010398000 is 89301031.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×130103980002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (13010398001) 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, 3250600 + ... + 3254599.
It is an arithmetic number, because the mean of its divisors is an integer number (786478680).
Almost surely, 213010398000 is an apocalyptic number.
13010398000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13010398000 is an abundant number, since it is smaller than the sum of its proper divisors (18448749200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13010398000 is an equidigital number, since it uses as much as digits as its factorization.
13010398000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6505222 (or 6505206 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 13010398000 its reverse (89301031), we get a palindrome (13099699031).
The spelling of 13010398000 in words is "thirteen billion, ten million, three hundred ninety-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •