Base | Representation |
---|---|
bin | 1011111010100101001011… |
… | …1010011011111110010000 |
3 | 1201101110002002112120022021 |
4 | 2332221102322123332100 |
5 | 3204121413033202230 |
6 | 43510311342221224 |
7 | 2521343005455106 |
oct | 276512272337620 |
9 | 51343062476267 |
10 | 13101041303440 |
11 | 41a11362aa552 |
12 | 15770a0284814 |
13 | 740566136c2c |
14 | 3341454a5c76 |
15 | 17abc5010c7a |
hex | bea52e9bf90 |
13101041303440 has 20 divisors (see below), whose sum is σ = 30459921030684. Its totient is φ = 5240416521344.
The previous prime is 13101041303387. The next prime is 13101041303459. The reversal of 13101041303440 is 4430314010131.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 8918967223296 + 4182074080144 = 2986464^2 + 2045012^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81881508067 + ... + 81881508226.
Almost surely, 213101041303440 is an apocalyptic number.
13101041303440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13101041303440 is an abundant number, since it is smaller than the sum of its proper divisors (17358879727244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13101041303440 is a wasteful number, since it uses less digits than its factorization.
13101041303440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163763016306 (or 163763016300 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13101041303440 its reverse (4430314010131), we get a palindrome (17531355313571).
The spelling of 13101041303440 in words is "thirteen trillion, one hundred one billion, forty-one million, three hundred three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •