Search a number
-
+
10465450233 = 37271193539
BaseRepresentation
bin10011011111100101…
…00001100011111001
31000000100120221210220
421233302201203321
5132413123401413
64450250530253
7520225600500
oct115762414371
930010527726
1010465450233
114490523727
122040a36989
13caa266704
14713cc3837
15413b9e223
hex26fca18f9

10465450233 has 12 divisors (see below), whose sum is σ = 16232127120. Its totient is φ = 5980257192.

The previous prime is 10465450213. The next prime is 10465450243. The reversal of 10465450233 is 33205456401.

It is not a de Polignac number, because 10465450233 - 26 = 10465450169 is a prime.

It is a super-3 number, since 3×104654502333 (a number of 31 digits) contains 333 as substring.

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (10465450213) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 35596623 + ... + 35596916.

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

Almost surely, 210465450233 is an apocalyptic number.

It is an amenable number.

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

10465450233 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 71193556 (or 71193549 counting only the distinct ones).

The product of its (nonzero) digits is 43200, while the sum is 33.

The spelling of 10465450233 in words is "ten billion, four hundred sixty-five million, four hundred fifty thousand, two hundred thirty-three".

Divisors: 1 3 7 21 49 147 71193539 213580617 498354773 1495064319 3488483411 10465450233