Base | Representation |
---|---|
bin | 1100111100010011101010… |
… | …11001000111110110111110 |
3 | 10201202210022210121201212110 |
4 | 12132021311121013312332 |
5 | 12212243421220321413 |
6 | 140310312053114450 |
7 | 5665124544330051 |
oct | 636116531076676 |
9 | 121683283551773 |
10 | 28460422823358 |
11 | 9082aa77a4119 |
12 | 32379a2028a26 |
13 | 12b5a63746236 |
14 | 7056c5778a98 |
15 | 3454c31188c3 |
hex | 19e275647dbe |
28460422823358 has 8 divisors (see below), whose sum is σ = 56920845646728. Its totient is φ = 9486807607784.
The previous prime is 28460422823309. The next prime is 28460422823359. The reversal of 28460422823358 is 85332822406482.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
28460422823358 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 28460422823298 and 28460422823307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28460422823359) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2371701901941 + ... + 2371701901952.
It is an arithmetic number, because the mean of its divisors is an integer number (7115105705841).
Almost surely, 228460422823358 is an apocalyptic number.
28460422823358 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28460422823358 is a wasteful number, since it uses less digits than its factorization.
28460422823358 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4743403803898.
The product of its (nonzero) digits is 35389440, while the sum is 57.
The spelling of 28460422823358 in words is "twenty-eight trillion, four hundred sixty billion, four hundred twenty-two million, eight hundred twenty-three thousand, three hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.502 sec. • engine limits •