Base | Representation |
---|---|
bin | 110100011101100010101010… |
… | …0111011101001110100001010 |
3 | 2020111212212012011211002101022 |
4 | 1220323011110323221310022 |
5 | 440441002422040022300 |
6 | 4313234231100152442 |
7 | 166125111536124410 |
oct | 15073052473516412 |
9 | 2214785164732338 |
10 | 461457006173450 |
11 | 1240418a9909931 |
12 | 43909561838722 |
13 | 16a6429412a991 |
14 | 81d48d15a32b0 |
15 | 385385081e285 |
hex | 1a3b154ee9d0a |
461457006173450 has 48 divisors (see below), whose sum is σ = 982525955861760. Its totient is φ = 157955733011520.
The previous prime is 461457006173407. The next prime is 461457006173459. The reversal of 461457006173450 is 54371600754164.
It is a super-2 number, since 2×4614570061734502 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 461457006173392 and 461457006173401.
It is not an unprimeable number, because it can be changed into a prime (461457006173459) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1075192130 + ... + 1075621229.
It is an arithmetic number, because the mean of its divisors is an integer number (20469290747120).
Almost surely, 2461457006173450 is an apocalyptic number.
461457006173450 is an abundant number, since it is smaller than the sum of its proper divisors (521068949688310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
461457006173450 is a wasteful number, since it uses less digits than its factorization.
461457006173450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2150813991 (or 2150813986 counting only the distinct ones).
The product of its (nonzero) digits is 8467200, while the sum is 53.
The spelling of 461457006173450 in words is "four hundred sixty-one trillion, four hundred fifty-seven billion, six million, one hundred seventy-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •