Base | Representation |
---|---|
bin | 1011110100111000000011… |
… | …1111000001101001000000 |
3 | 1201001002002112000000012002 |
4 | 2331032000333001221000 |
5 | 3201020201140313212 |
6 | 43353302020123132 |
7 | 2511303130305140 |
oct | 275160077015100 |
9 | 51032075000162 |
10 | 13003030010432 |
11 | 41636104a8450 |
12 | 15600a85364a8 |
13 | 7342466495b7 |
14 | 32d4c8600920 |
15 | 17838a6a7ac2 |
hex | bd380fc1a40 |
13003030010432 has 224 divisors, whose sum is σ = 32434332733440. Its totient is φ = 5024507904000.
The previous prime is 13003030010419. The next prime is 13003030010441. The reversal of 13003030010432 is 23401003030031.
It is a tau number, because it is divible by the number of its divisors (224).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1343422169 + ... + 1343431847.
Almost surely, 213003030010432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13003030010432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16217166366720).
13003030010432 is an abundant number, since it is smaller than the sum of its proper divisors (19431302723008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13003030010432 is a wasteful number, since it uses less digits than its factorization.
13003030010432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11921 (or 11911 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13003030010432 its reverse (23401003030031), we get a palindrome (36404033040463).
The spelling of 13003030010432 in words is "thirteen trillion, three billion, thirty million, ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •