Base | Representation |
---|---|
bin | 11000101001001001… |
… | …10100111001000000 |
3 | 1021011000202201100220 |
4 | 30110210310321000 |
5 | 204043401200112 |
6 | 10024450543040 |
7 | 645565665132 |
oct | 142444647100 |
9 | 37130681326 |
10 | 13230100032 |
11 | 567a056a76 |
12 | 2692897a80 |
13 | 132ac67676 |
14 | 8d7145052 |
15 | 52675498c |
hex | 314934e40 |
13230100032 has 112 divisors (see below), whose sum is σ = 35428976640. Its totient is φ = 4356882432.
The previous prime is 13230099979. The next prime is 13230100057. The reversal of 13230100032 is 23000103231.
It is a junction number, because it is equal to n+sod(n) for n = 13230099984 and 13230100020.
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 15 ways as a sum of consecutive naturals, for example, 6558288 + ... + 6560304.
Almost surely, 213230100032 is an apocalyptic number.
13230100032 is a gapful number since it is divisible by the number (12) 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 13230100032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17714488320).
13230100032 is an abundant number, since it is smaller than the sum of its proper divisors (22198876608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13230100032 is a wasteful number, since it uses less digits than its factorization.
13230100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2428 (or 2418 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 13230100032 its reverse (23000103231), we get a palindrome (36230203263).
The spelling of 13230100032 in words is "thirteen billion, two hundred thirty million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •