Search a number
-
+
46510500131 = 283164348057
BaseRepresentation
bin101011010100001111…
…011110100100100011
311110001101201012200222
4223110033132210203
51230223142001011
633211105233255
73234400504514
oct532417364443
9143041635628
1046510500131
11187a7a68167
12902033282b
134502b3b7c4
142373106a0b
15132335dddb
hexad43de923

46510500131 has 4 divisors (see below), whose sum is σ = 46674848472. Its totient is φ = 46346151792.

The previous prime is 46510500089. The next prime is 46510500133. The reversal of 46510500131 is 13100501564.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 46510500131 - 26 = 46510500067 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 46510500131.

It is not an unprimeable number, because it can be changed into a prime (46510500133) 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 3 ways as a sum of consecutive naturals, for example, 82173746 + ... + 82174311.

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

Almost surely, 246510500131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 164348340.

The product of its (nonzero) digits is 1800, while the sum is 26.

The spelling of 46510500131 in words is "forty-six billion, five hundred ten million, five hundred thousand, one hundred thirty-one".

Divisors: 1 283 164348057 46510500131