Search a number
-
+
466206640040145 = 35110343728166939
BaseRepresentation
bin110101000000000110011000…
…1001010111110100011010001
32021010200220211022212212012110
41222000030301022332203101
5442101312144322241040
64331312212421415533
7200125214101640004
oct15200146112764321
92233626738785173
10466206640040145
11125603142358834
1244355b7856a5a9
131701a13631b724
14831a743a6b53b
1538d7188002980
hex1a803312be8d1

466206640040145 has 16 divisors (see below), whose sum is σ = 745931326553280. Its totient is φ = 248643307191744.

The previous prime is 466206640040123. The next prime is 466206640040179. The reversal of 466206640040145 is 541040046602664.

It is not a de Polignac number, because 466206640040145 - 210 = 466206640039121 is a prime.

It is a super-2 number, since 2×4662066400401452 (a number of 30 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 466206640040094 and 466206640040103.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2468086 + ... + 30635024.

It is an arithmetic number, because the mean of its divisors is an integer number (46620707909580).

Almost surely, 2466206640040145 is an apocalyptic number.

It is an amenable number.

466206640040145 is a deficient number, since it is larger than the sum of its proper divisors (279724686513135).

466206640040145 is a wasteful number, since it uses less digits than its factorization.

466206640040145 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 29270384.

The product of its (nonzero) digits is 3317760, while the sum is 48.

The spelling of 466206640040145 in words is "four hundred sixty-six trillion, two hundred six billion, six hundred forty million, forty thousand, one hundred forty-five".

Divisors: 1 3 5 15 1103437 3310311 5517185 16551555 28166939 84500817 140834695 422504085 31080442669343 93241328008029 155402213346715 466206640040145