Base | Representation |
---|---|
bin | 111011001010011100111011… |
… | …100001000010011111100000 |
3 | 1021010022011102121111100022002 |
4 | 323022130323201002133200 |
5 | 233101131222031212042 |
6 | 2321223335313503132 |
7 | 105544021650630002 |
oct | 7312347341023740 |
9 | 1233264377440262 |
10 | 260203002210272 |
11 | 759aa5232a6670 |
12 | 25225102b71aa8 |
13 | b226065135b04 |
14 | 4837c6d05c372 |
15 | 2013725945132 |
hex | eca73b8427e0 |
260203002210272 has 24 divisors (see below), whose sum is σ = 558845084293272. Its totient is φ = 118274091913600.
The previous prime is 260203002210253. The next prime is 260203002210323. The reversal of 260203002210272 is 272012200302062.
260203002210272 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 369606536879 + ... + 369606537582.
It is an arithmetic number, because the mean of its divisors is an integer number (23285211845553).
Almost surely, 2260203002210272 is an apocalyptic number.
260203002210272 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
260203002210272 is an abundant number, since it is smaller than the sum of its proper divisors (298642082083000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260203002210272 is a wasteful number, since it uses less digits than its factorization.
260203002210272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 739213074482 (or 739213074474 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 29.
The spelling of 260203002210272 in words is "two hundred sixty trillion, two hundred three billion, two million, two hundred ten thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •