Base | Representation |
---|---|
bin | 11000101000010011… |
… | …11001100001010000 |
3 | 1021010112111002100010 |
4 | 30110021321201100 |
5 | 204040044303404 |
6 | 10024035354520 |
7 | 645451665150 |
oct | 142411714120 |
9 | 37115432303 |
10 | 13223041104 |
11 | 5676075549 |
12 | 2690452a40 |
13 | 13296656a0 |
14 | 8d6228760 |
15 | 525d0d189 |
hex | 314279850 |
13223041104 has 160 divisors (see below), whose sum is σ = 42101305344. Its totient is φ = 3482519040.
The previous prime is 13223041079. The next prime is 13223041151. The reversal of 13223041104 is 40114032231.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 3977587 + ... + 3980909.
Almost surely, 213223041104 is an apocalyptic number.
13223041104 is a gapful number since it is divisible by the number (14) 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 13223041104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21050652672).
13223041104 is an abundant number, since it is smaller than the sum of its proper divisors (28878264240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13223041104 is a wasteful number, since it uses less digits than its factorization.
13223041104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4265 (or 4259 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 13223041104 its reverse (40114032231), we get a palindrome (53337073335).
The spelling of 13223041104 in words is "thirteen billion, two hundred twenty-three million, forty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •