Base | Representation |
---|---|
bin | 11010110000100001… |
… | …110100111010010001 |
3 | 2202011100022110101000 |
4 | 122300201310322101 |
5 | 432320223230030 |
6 | 21110554532213 |
7 | 2034664251123 |
oct | 326041647221 |
9 | 82140273330 |
10 | 28731461265 |
11 | 11204185111 |
12 | 569a137069 |
13 | 292b624270 |
14 | 1567b97213 |
15 | b325a0860 |
hex | 6b0874e91 |
28731461265 has 32 divisors (see below), whose sum is σ = 55007245440. Its totient is φ = 14144718528.
The previous prime is 28731461263. The next prime is 28731461267. The reversal of 28731461265 is 56216413782.
28731461265 is a `hidden beast` number, since 28 + 7 + 3 + 1 + 4 + 612 + 6 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (28731461263) and next prime (28731461267).
It is not a de Polignac number, because 28731461265 - 21 = 28731461263 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 28731461265.
It is not an unprimeable number, because it can be changed into a prime (28731461263) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8183847 + ... + 8187356.
It is an arithmetic number, because the mean of its divisors is an integer number (1718976420).
Almost surely, 228731461265 is an apocalyptic number.
It is an amenable number.
28731461265 is a deficient number, since it is larger than the sum of its proper divisors (26275784175).
28731461265 is a wasteful number, since it uses less digits than its factorization.
28731461265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16371230 (or 16371224 counting only the distinct ones).
The product of its digits is 483840, while the sum is 45.
The spelling of 28731461265 in words is "twenty-eight billion, seven hundred thirty-one million, four hundred sixty-one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •