Base | Representation |
---|---|
bin | 11000010011000001… |
… | …00011000111001010 |
3 | 1020200002101122221120 |
4 | 30021200203013022 |
5 | 203203333214013 |
6 | 5554215220110 |
7 | 641152551000 |
oct | 141140430712 |
9 | 36602348846 |
10 | 13044429258 |
11 | 5594270853 |
12 | 2640677636 |
13 | 12cb6595c3 |
14 | 8ba612a70 |
15 | 5152cb123 |
hex | 3098231ca |
13044429258 has 64 divisors (see below), whose sum is σ = 30878745600. Its totient is φ = 3671314416.
The previous prime is 13044429257. The next prime is 13044429263. The reversal of 13044429258 is 85292444031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (13044429257) by changing a digit.
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, 90585 + ... + 185187.
It is an arithmetic number, because the mean of its divisors is an integer number (482480400).
Almost surely, 213044429258 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13044429258, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15439372800).
13044429258 is an abundant number, since it is smaller than the sum of its proper divisors (17834316342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13044429258 is an equidigital number, since it uses as much as digits as its factorization.
13044429258 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94696 (or 94682 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 42.
The spelling of 13044429258 in words is "thirteen billion, forty-four million, four hundred twenty-nine thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •