Base | Representation |
---|---|
bin | 1011111000011100101110… |
… | …0100010000011000001010 |
3 | 1201020221112020211112010220 |
4 | 2332013023210100120022 |
5 | 3203021403132420000 |
6 | 43441412452050510 |
7 | 2515605164525010 |
oct | 276071344203012 |
9 | 51227466745126 |
10 | 13064410826250 |
11 | 4187649360903 |
12 | 156bb78903a36 |
13 | 739c79199264 |
14 | 33246c6108b0 |
15 | 179c7e2611a0 |
hex | be1cb91060a |
13064410826250 has 320 divisors, whose sum is σ = 37468067180544. Its totient is φ = 2973928320000.
The previous prime is 13064410826191. The next prime is 13064410826297. The reversal of 13064410826250 is 5262801446031.
It is a Harshad number since it is a multiple of its sum of digits (42).
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 159 ways as a sum of consecutive naturals, for example, 9599125570 + ... + 9599126930.
Almost surely, 213064410826250 is an apocalyptic number.
13064410826250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13064410826250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18734033590272).
13064410826250 is an abundant number, since it is smaller than the sum of its proper divisors (24403656354294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13064410826250 is a wasteful number, since it uses less digits than its factorization.
13064410826250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2623 (or 2608 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 42.
The spelling of 13064410826250 in words is "thirteen trillion, sixty-four billion, four hundred ten million, eight hundred twenty-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •