Base | Representation |
---|---|
bin | 100110101101101… |
… | …0101001011100000 |
3 | 10100112022120002120 |
4 | 1031123111023200 |
5 | 10130021312042 |
6 | 332522144240 |
7 | 44122255650 |
oct | 11533251340 |
9 | 3315276076 |
10 | 1299010272 |
11 | 60729170a |
12 | 303052080 |
13 | 17917c641 |
14 | c4744360 |
15 | 79096dec |
hex | 4d6d52e0 |
1299010272 has 96 divisors (see below), whose sum is σ = 3946521600. Its totient is φ = 366432768.
The previous prime is 1299010213. The next prime is 1299010301. The reversal of 1299010272 is 2720109921.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40854 + ... + 65322.
It is an arithmetic number, because the mean of its divisors is an integer number (41109600).
Almost surely, 21299010272 is an apocalyptic number.
1299010272 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 1299010272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1973260800).
1299010272 is an abundant number, since it is smaller than the sum of its proper divisors (2647511328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1299010272 is a wasteful number, since it uses less digits than its factorization.
1299010272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24568 (or 24560 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 33.
The square root of 1299010272 is about 36041.7850834278. The cubic root of 1299010272 is about 1091.1158429749.
The spelling of 1299010272 in words is "one billion, two hundred ninety-nine million, ten thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •