Base | Representation |
---|---|
bin | 11000011001100011… |
… | …01111000011011110 |
3 | 1020210220120200012000 |
4 | 30030301233003132 |
5 | 203311403010040 |
6 | 10003454423130 |
7 | 642416632446 |
oct | 141461570336 |
9 | 36726520160 |
10 | 13099266270 |
11 | 56122156a2 |
12 | 2656b01aa6 |
13 | 1309b1953c |
14 | 8c3a09126 |
15 | 51a00e130 |
hex | 30cc6f0de |
13099266270 has 128 divisors (see below), whose sum is σ = 35586293760. Its totient is φ = 3427920000.
The previous prime is 13099266253. The next prime is 13099266289. The reversal of 13099266270 is 7266299031.
It is a happy number.
13099266270 is a `hidden beast` number, since 1 + 30 + 99 + 266 + 270 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11380195 + ... + 11381345.
It is an arithmetic number, because the mean of its divisors is an integer number (278017920).
Almost surely, 213099266270 is an apocalyptic number.
13099266270 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 13099266270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17793146880).
13099266270 is an abundant number, since it is smaller than the sum of its proper divisors (22487027490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13099266270 is a wasteful number, since it uses less digits than its factorization.
13099266270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1919 (or 1913 counting only the distinct ones).
The product of its (nonzero) digits is 244944, while the sum is 45.
The spelling of 13099266270 in words is "thirteen billion, ninety-nine million, two hundred sixty-six thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •