Base | Representation |
---|---|
bin | 111011001110001000000001… |
… | …011101011101011111001000 |
3 | 1021011012021222211021220222122 |
4 | 323032020001131131133020 |
5 | 233114300210400423300 |
6 | 2321535323500310412 |
7 | 105601166250321434 |
oct | 7316100135353710 |
9 | 1234167884256878 |
10 | 260455431264200 |
11 | 75a97589986aa7 |
12 | 25266010b42408 |
13 | b243ac3513b03 |
14 | 48461782d39c4 |
15 | 201a09bb23c85 |
hex | ece20175d7c8 |
260455431264200 has 48 divisors (see below), whose sum is σ = 631887524556480. Its totient is φ = 99652512829760.
The previous prime is 260455431264179. The next prime is 260455431264241. The reversal of 260455431264200 is 2462134554062.
It is a happy number.
260455431264200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28310368364 + ... + 28310377563.
It is an arithmetic number, because the mean of its divisors is an integer number (13164323428260).
Almost surely, 2260455431264200 is an apocalyptic number.
260455431264200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
260455431264200 is an abundant number, since it is smaller than the sum of its proper divisors (371432093292280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260455431264200 is a wasteful number, since it uses less digits than its factorization.
260455431264200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56620745966 (or 56620745957 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 44.
The spelling of 260455431264200 in words is "two hundred sixty trillion, four hundred fifty-five billion, four hundred thirty-one million, two hundred sixty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •