Base | Representation |
---|---|
bin | 11000001111010010… |
… | …00010101100001000 |
3 | 1020120220110001002120 |
4 | 30013221002230020 |
5 | 203122323220240 |
6 | 5551135531240 |
7 | 640322351622 |
oct | 140751025410 |
9 | 36526401076 |
10 | 13013101320 |
11 | 557861369a |
12 | 2632089b20 |
13 | 12c500b06b |
14 | 8b63b9c12 |
15 | 51268dad0 |
hex | 307a42b08 |
13013101320 has 32 divisors (see below), whose sum is σ = 39039304320. Its totient is φ = 3470160320.
The previous prime is 13013101319. The next prime is 13013101337. The reversal of 13013101320 is 2310131031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13013101320.
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 7 ways as a sum of consecutive naturals, for example, 54221136 + ... + 54221375.
It is an arithmetic number, because the mean of its divisors is an integer number (1219978260).
Almost surely, 213013101320 is an apocalyptic number.
13013101320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13013101320 is an abundant number, since it is smaller than the sum of its proper divisors (26026203000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13013101320 is a wasteful number, since it uses less digits than its factorization.
13013101320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108442525 (or 108442521 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13013101320 its reverse (2310131031), we get a palindrome (15323232351).
The spelling of 13013101320 in words is "thirteen billion, thirteen million, one hundred one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •