Base | Representation |
---|---|
bin | 1010101010100110… |
… | …1101100110111000 |
3 | 21101112100120221022 |
4 | 2222221231212320 |
5 | 21330420431212 |
6 | 1152033202012 |
7 | 130643422610 |
oct | 25251554670 |
9 | 7345316838 |
10 | 2863061432 |
11 | 123a13a480 |
12 | 67aa00308 |
13 | 3682097ba |
14 | 1d235ba40 |
15 | 11b544772 |
hex | aaa6d9b8 |
2863061432 has 64 divisors (see below), whose sum is σ = 6848582400. Its totient is φ = 1089527040.
The previous prime is 2863061423. The next prime is 2863061437. The reversal of 2863061432 is 2341603682.
It is a junction number, because it is equal to n+sod(n) for n = 2863061392 and 2863061401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2863061437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27557 + ... + 80532.
It is an arithmetic number, because the mean of its divisors is an integer number (107009100).
Almost surely, 22863061432 is an apocalyptic number.
2863061432 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2863061432 is an abundant number, since it is smaller than the sum of its proper divisors (3985520968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2863061432 is a wasteful number, since it uses less digits than its factorization.
2863061432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108156 (or 108152 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 35.
The square root of 2863061432 is about 53507.5829392433. The cubic root of 2863061432 is about 1419.9625448032.
The spelling of 2863061432 in words is "two billion, eight hundred sixty-three million, sixty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •