Base | Representation |
---|---|
bin | 10010111011001110110… |
… | …101010010101111010000 |
3 | 11121022221120122112010000 |
4 | 102323032311102233100 |
5 | 132302011322402042 |
6 | 2433244200210000 |
7 | 162650563205661 |
oct | 22731665225720 |
9 | 4538846575100 |
10 | 1300550200272 |
11 | 461618756864 |
12 | 19007b769900 |
13 | 958450a7b2b |
14 | 46d3868b368 |
15 | 23c6c3a774c |
hex | 12eced52bd0 |
1300550200272 has 400 divisors, whose sum is σ = 3940702653888. Its totient is φ = 413700618240.
The previous prime is 1300550200267. The next prime is 1300550200289. The reversal of 1300550200272 is 2720020550031.
1300550200272 is a `hidden beast` number, since 130 + 0 + 5 + 502 + 0 + 0 + 27 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 1472876343 + ... + 1472877225.
Almost surely, 21300550200272 is an apocalyptic number.
1300550200272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1300550200272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1970351326944).
1300550200272 is an abundant number, since it is smaller than the sum of its proper divisors (2640152453616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300550200272 is a wasteful number, since it uses less digits than its factorization.
1300550200272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1520 (or 1505 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The spelling of 1300550200272 in words is "one trillion, three hundred billion, five hundred fifty million, two hundred thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •