Base | Representation |
---|---|
bin | 1011111000010101111111… |
… | …0100111100101001000010 |
3 | 1201020202212021120202212110 |
4 | 2332011133310330221002 |
5 | 3203004202413400110 |
6 | 43440513241440150 |
7 | 2515512325505643 |
oct | 276053764745102 |
9 | 51222767522773 |
10 | 13062603262530 |
11 | 4186901000498 |
12 | 156b7534a0056 |
13 | 739a4b85b523 |
14 | 33233a5296ca |
15 | 179bc5711a20 |
hex | be15fd3ca42 |
13062603262530 has 128 divisors (see below), whose sum is σ = 33708566016000. Its totient is φ = 3229221302784.
The previous prime is 13062603262441. The next prime is 13062603262543. The reversal of 13062603262530 is 3526230626031.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 156492246 + ... + 156575694.
It is an arithmetic number, because the mean of its divisors is an integer number (263348172000).
Almost surely, 213062603262530 is an apocalyptic number.
13062603262530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13062603262530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16854283008000).
13062603262530 is an abundant number, since it is smaller than the sum of its proper divisors (20645962753470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13062603262530 is a wasteful number, since it uses less digits than its factorization.
13062603262530 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89368.
The product of its (nonzero) digits is 233280, while the sum is 39.
Adding to 13062603262530 its reverse (3526230626031), we get a palindrome (16588833888561).
The spelling of 13062603262530 in words is "thirteen trillion, sixty-two billion, six hundred three million, two hundred sixty-two thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •