Base | Representation |
---|---|
bin | 11000101001001001… |
… | …11001110001000000 |
3 | 1021011000210201202110 |
4 | 30110210321301000 |
5 | 204043402320000 |
6 | 10024451215320 |
7 | 645566110266 |
oct | 142444716100 |
9 | 37130721673 |
10 | 13230120000 |
11 | 567a06aa79 |
12 | 26928a7540 |
13 | 132ac73796 |
14 | 8d714c436 |
15 | 52675a850 |
hex | 314939c40 |
13230120000 has 140 divisors (see below), whose sum is σ = 43742260496. Its totient is φ = 3528000000.
The previous prime is 13230119951. The next prime is 13230120011. The reversal of 13230120000 is 2103231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 64875 + ... + 175125.
Almost surely, 213230120000 is an apocalyptic number.
13230120000 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 13230120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21871130248).
13230120000 is an abundant number, since it is smaller than the sum of its proper divisors (30512140496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13230120000 is an equidigital number, since it uses as much as digits as its factorization.
13230120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110286 (or 110261 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 13230120000 its reverse (2103231), we get a palindrome (13232223231).
The spelling of 13230120000 in words is "thirteen billion, two hundred thirty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •