Base | Representation |
---|---|
bin | 11000100101100000… |
… | …010110001000110010 |
3 | 2112010210110011222002 |
4 | 120211200112020302 |
5 | 413031123240200 |
6 | 20043315014002 |
7 | 1623123065225 |
oct | 304540261062 |
9 | 75123404862 |
10 | 26399040050 |
11 | 1021762a579 |
12 | 5148b9a302 |
13 | 264933a076 |
14 | 13c60c95bc |
15 | a47927bd5 |
hex | 625816232 |
26399040050 has 48 divisors (see below), whose sum is σ = 51520577472. Its totient is φ = 10044619200.
The previous prime is 26399040049. The next prime is 26399040091. The reversal of 26399040050 is 5004099362.
It is a junction number, because it is equal to n+sod(n) for n = 26399039986 and 26399040013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 144737 + ... + 271563.
It is an arithmetic number, because the mean of its divisors is an integer number (1073345364).
Almost surely, 226399040050 is an apocalyptic number.
26399040050 is a deficient number, since it is larger than the sum of its proper divisors (25121537422).
26399040050 is a wasteful number, since it uses less digits than its factorization.
26399040050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127043 (or 127038 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 38.
The spelling of 26399040050 in words is "twenty-six billion, three hundred ninety-nine million, forty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •